Brooks' Theorem

Graph Coloring and Critical Graphs

Michael Stiebitz, Thomas Schweser, Bjarne Toft

$354.95 $284.08

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer International Publishing AG
15 March 2024

Combinatorics & graph theory

Series: Springer Monographs in Mathematics

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.

By: Michael Stiebitz, Thomas Schweser, Bjarne Toft
Imprint: Springer International Publishing AG
Country of Publication: Switzerland
Edition: 2024 ed.
Dimensions: Height: 235mm, Width: 155mm,
ISBN: 9783031500640
ISBN 10: 3031500644
Series: Springer Monographs in Mathematics
Pages: 655
Publication Date: 15 March 2024
Audience: Professional and scholarly , Undergraduate
Format: Hardback
Publisher's Status: Active

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)

Reviews for Brooks' Theorem: Graph Coloring and Critical Graphs

“There are multiple problems in each chapter, copious notes on the results and a substantial bibliography. It seems likely this book will be a valuable resource for results and methods in this area for a long time.” (David B. Penman, zbMATH 1536.05004, 2024)