
- Publisher's listprice EUR 181.89
-
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 8% (cc. 6 173 Ft off)
- Discounted price 70 985 Ft (67 604 Ft + 5% VAT)
77 157 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2024
- Publisher Springer
- Date of Publication 15 March 2024
- Number of Volumes 1 pieces, Book
- ISBN 9783031500640
- Binding Hardback
- No. of pages655 pages
- Size 235x155 mm
- Language English
- Illustrations 61 Illustrations, black & white 695
Categories
Short 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.
MoreLong 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.
?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)
MoreTable of Contents:
1 Degree Bounds for the Chromatic Number.- 2 Degeneracy and Colorings.- 3 Colorings and Orientations of Graphs.- 4 Properties of Critical Graphs.- 5 Critical Graphs with few Edges.- 6 Bounding ? by ? and ?.- 7 Coloring of Hypergraphs.- 8 Homomorphisms and Colorings.- 9 Coloring Graphs on Surface.- Appendix A: Brooks? Fundamental Paper.- Appendix B: Tutte?s Lecture from 1992.- Appendix C: Basic Graph Theory Concepts.
More