Brooks' Theorem Graph Coloring and Critical Graphs /

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Stiebitz, Michael (Autor), Schweser, Thomas (Autor), Toft, Bjarne (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Lenguaje:inglés
Publicado: Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
Edición:1st ed. 2024.
Colección:Springer Monographs in Mathematics,
Materias:
Acceso en línea:https://doi.org/10.1007/978-3-031-50065-7
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Tabla de Contenidos:
  • 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.