Yet another proof of Brooks' theorem

DOI10.1016/J.DISC.2022.113261MaRDI QIDQ6091817OpenAlexFDO

Authors Landon Rabern

Publication date 27 November 2023

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringBrooks' theoremmaximal independent set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Abstract: Arguably the simplest variation of this style of proof as we avoid reducing to the cubic case entirely.

Cites work

• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• A different short proof of Brooks' theorem
• Brooks' Theorem and Beyond

Cited in

(2)

• scientific article; zbMATH DE number 125481 (Why is no real title available?)
• Brooks' Theorem and Beyond

This page was built for publication: Yet another proof of Brooks' theorem

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