Brooks' Theorem (1941) is one of the most famous and fundamental theorems in graph theory - it is mentioned/treated in all general monographs on graph theory. It has sparked research in several directions. This book presents a comprehensive overview of this development and see it in context. It describes results, both early and recent, and explains relations: the various proofs, the many extensions and similar results for other graph parameters. It serves as a valuable reference to a wealth of information, now scattered in journals, proceedings and dissertations. The reader gets easy access to this wealth of information in comprehensive form, including best known proofs of the results described. Each chapter ends in a note section with historical remarks, comments and further results. The book is also suitable for graduate courses in graph theory and includes exercises. The book is intended for readers wanting to dig deeper into graph coloring theory than what is possible in the existing book literature. There is a comprehensive list of references to original sources.
Select a Delivery Option
Brooks' Theorem: Graph Coloring and Critical Graphs
You’re item was added to pickup at [location]
You’re [amount] away from FREE shipping!
You qualify for FREE shipping!
Translation missing: en.settings.free_shipping_default_message
Brooks' Theorem: Graph Coloring and Critical Graphs
MICHAEL STIEBITZ graduated from Humboldt University in Berlin in 1977. He obtained a doctorate at the Technical University of Ilmenau in 1981 and has served as professor there until 2022. He has published around 70 research papers on graph theory, in particular on coloring problems. He is the main author of the book Graph Edge Coloring (Wiley 2012).
THOMAS SCHWESER obtained a doctorate at the Technical University of Ilmenau in 2020, supervised by Michael Stiebitz. He has published around 15 research papers and is currently working in the private industrial sector as a researcher in database theory.
BJARNE TOFT graduated from Aarhus University in 1968 and obtained a doctorate from the University of London in 1970. He is author of around 65 research papers. His mathematical interests are graph theory, combinatorial game theory and the history of mathematics. He co-authored Graph Coloring Problems (Wiley 1995), and is second author of Graph Edge Coloring (Wiley 2012) and HEX The Full Story (CRC Press 2019)
You May Also Like
Previous
Next
Recently Viewed
Choosing a selection results in a full page refresh.
Opens in a new window.
eBooks from Indigo are available at Kobo.com
Simply sign in or create your free Kobo account to get started. Read eBooks on any Kobo eReader or with the free Kobo App.
Why Kobo?
With over 6 million of the world's best eBooks to choose from, Kobo offers you a whole world of reading. Go shelf-less with your library and enjoy reward points with every purchase.