This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Stephen Hedetniemi. The purpose of this book is to provide background and principal results on these topics, along with same related problems and conjectures, for researchers in these areas. The most important features deal with material, results, and problems that researchers may not be aware of but may find of interest. Each chapter contains results, methods and information that will give readers the necessary background to investigate each topic in more detail.
1. Pioneer of Domination in Graphs.- 2. Key Domination Parameters.- 3. Dominating Functions.- 4. Domination-Related Parameters and Applications.- 5. Distance-Defined Subgraphs.- 6. Eulerian and Hamiltonian Walks.- 7. Complete Colorings.- 8. Color Connection and Disconnection.
This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Stephen Hedetniemi. The purpose of this book is to provide background and principal results on these topics, along with same related problems and conjectures, for researchers in these areas. The most important features deal with material, results, and problems that researchers may not be aware of but may find of interest. Each chapter contains results, methods and information that will give readers the necessary background to investigate each topic in more detail.
1. Pioneer of Domination in Graphs.- 2. Key Domination Parameters.- 3. Dominating Functions.- 4. Domination-Related Parameters and Applications.- 5. Distance-Defined Subgraphs.- 6. Eulerian and Hamiltonian Walks.- 7. Complete Colorings.- 8. Color Connection and Disconnection.
1. Pioneer of Domination in Graphs.- 2. Key Domination Parameters.- 3. Dominating Functions.- 4. Domination-Related Parameters and Applications.- 5. Distance-Defined Subgraphs.- 6. Eulerian and Hamiltonian Walks.- 7. Complete Colorings.- 8. Color Connection and Disconnection.
“All the compliments to the authors for such a marvelous idea. … The most of the text is written in a survey style with some included proofs. … Most of results presented in the book are bounds on several invariants or parameters connected with previously mentioned terms with respect to the order of a graph.” (Iztok Peterin, zbMATH 1470.05001, 2021)
|
Ask a Question About this Product More... |
|
