Yet another proof of Brooks' theorem

DOI10.1016/J.DISC.2022.113261arXiv1409.6812OpenAlexW2233420671MaRDI QIDQ6091817FDOQ6091817

Landon Rabern

Publication date: 27 November 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

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)

Cites Work

• Title not available (Why is that?)
• A different short proof of Brooks' theorem
• Brooks' Theorem and Beyond

Cited In (2)

• Title not available (Why is that?)
• 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)