A short proof of Brooks' theorem
arXiv: Combinatorics(2018)
Abstract
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.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined