On Schmerl's effective version of Brooks' theorem

DOI10.1016/0095-8956(84)90041-8zbMath0576.05022OpenAlexW2070194138MaRDI QIDQ1065017

Helge Tverberg

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90041-8

zbMATH Keywords

Brooks' theoremhighly recursive graphrecursive k-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Brooks' Theorem and Beyond, On the strength of König's duality theorem for infinite bipartite graphs, On the complexity of finding the chromatic number of a recursive graph. I: The bounded case

Cites Work

• The Effective Version of Brooks' Theorem
• On Brooks' theorem and some related results.