ShopSpell

From Domination to Coloring: Stephen Hedetniemi's Graph Theory and Beyond [Paperback]

$46.99     $64.99   28% Off      (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • Author:  Chartrand, Gary, Haynes, Teresa W., Henning, Michael A., Zhang, Ping
  • Author:  Chartrand, Gary, Haynes, Teresa W., Henning, Michael A., Zhang, Ping
  • ISBN-10:  3030311090
  • ISBN-10:  3030311090
  • ISBN-13:  9783030311094
  • ISBN-13:  9783030311094
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Mar-2019
  • Pub Date:  01-Mar-2019
  • SKU:  3030311090-11-SPRI
  • SKU:  3030311090-11-SPRI
  • Pages:  94
  • Pages:  94
  • Item ID: 103485435
  • List Price: $64.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Oct 27 to Oct 29
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.
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.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)
Add Review