A different short proof of Brooks' theorem
Combinatorics
2013-06-26 v5
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.
Cite
@article{arxiv.1205.3253,
title = {A different short proof of Brooks' theorem},
author = {Landon Rabern},
journal= {arXiv preprint arXiv:1205.3253},
year = {2013}
}
Comments
added cute Kernel Lemma trick to lift up to (online) list coloring