
From Domination to Coloring
Stephen Hedetniemi's Graph Theory and Beyond
Springer (Publisher)
1st Edition
Published on 28. October 2019
Book
Paperback/Softback
X, 94 pages
978-3-030-31109-4 (ISBN)
Description
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.
Reviews / Votes
"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)More details
Series
Edition
1st ed. 2019
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
7 farbige Abbildungen, 42 s/w Abbildungen
X, 94 p. 49 illus., 7 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 7 mm
Weight
172 gr
ISBN-13
978-3-030-31109-4 (9783030311094)
DOI
10.1007/978-3-030-31110-0
Schweitzer Classification
Other editions
Additional editions

Gary Chartrand | Teresa W. Haynes | Michael A. Henning
From Domination to Coloring
Stephen Hedetniemi's Graph Theory and Beyond
E-Book
10/2019
1st Edition
Springer
€64.19
Available for download
Content
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.