Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Brooks' Theorem : Graph Coloring and Critical Graphs, PDF eBook

Brooks' Theorem : Graph Coloring and Critical Graphs PDF

Part of the Springer Monographs in Mathematics series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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.

Information

Information

Also in the Springer Monographs in Mathematics series  |  View all