On Schmerl's effective version of Brooks' theorem

DOI10.1016/0095-8956(84)90041-8zbMATH Open0576.05022OpenAlexW2070194138MaRDI QIDQ1065017FDOQ1065017

Authors: 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)

Cites Work

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

Cited In (3)

• 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
• Brooks' Theorem and Beyond

This page was built for publication: On Schmerl's effective version of Brooks' theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065017)