A different short proof of Brooks' theorem
classification
🧮 math.CO
keywords
proofshortbrookscoloringdifferenttheoremcasecubic
read the original abstract
Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.