  We give a simple short proof of Brooks' theorem using only induction and
greedy coloring, while avoiding issues of graph connectivity. The argument
generalizes easily to some extensions of Brooks' theorem, including its
variants for list coloring, signed graphs coloring and correspondence coloring.
