A different short proof of Brooks' theorem

DOI10.7151/dmgt.1721zbMath1295.05110arXiv1205.3253OpenAlexW1967919382MaRDI QIDQ2509552

Landon Rabern

Publication date: 28 July 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.3253

zbMATH Keywords

clique numbercoloringmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

Brooks' Theorem and Beyond, Four proofs of the directed Brooks' theorem, Yet another proof of Brooks' theorem, Special issue in honour of Landon Rabern, A unified proof of Brooks' theorem and Catlin's theorem

Cites Work

• Three short proofs in graph theory
• On hitting all maximum cliques with an independent set
• On Brooks' theorem and some related results.
• Hitting all maximum cliques with a stable set using lopsided independent transversals
• Unnamed Item
• Unnamed Item
• Unnamed Item