A different short proof of Brooks' theorem
arXiv:1205.3253
Abstract
Lovász 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.
added cute Kernel Lemma trick to lift up to (online) list coloring