The Effective Version of Brooks' Theorem

DOI10.4153/CJM-1982-075-6zbMath0477.05035OpenAlexW2330963367MaRDI QIDQ3932823

James H. Schmerl

Publication date: 1982

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1982-075-6

zbMATH Keywords

cliqueBrooks' theoremrecursive k-regular graphrecursively k- colorable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Brooks' Theorem and Beyond ⋮ Feasible Graphs and Colorings ⋮ 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 ⋮ On Schmerl's effective version of Brooks' theorem

This page was built for publication: The Effective Version of Brooks' Theorem