Brooks' Theorem and Beyond

We collect some of our favorite proofs of Brooks' Theorem, highlighting advantages and extensions of each. The proofs illustrate some of the major techniques in graph coloring, such as greedy coloring, Kempe chains, hitting sets, and the Kernel Lemma. We also discuss standard strengthenings of vertex coloring, such as list coloring, online list coloring, and Alon-Tarsi orientations, since analogs of Brooks' Theorem hold in each context. We conclude with two conjectures along the lines of Brooks' Theorem that are much stronger, the Borodin-Kostochka Conjecture and Reed's Conjecture.

[1]  R. Entringer.  A Short Proof of Rubin's Block Theorem , 1985 .

[2]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[3]  Daniel W. Cranston,et al.  Coloring claw-free graphs with − 1 colors , 2012 .

[4]  Paul A. Catlin,et al.  Another bound on the chromatic number of a graph , 1978, Discret. Math..

[5]  H. Tverberg.  On Brooks' theorem and some related results. , 1983 .

[6]  Vaidy Sivaraman,et al.  A unified proof of Brooks' theorem and Catlin's theorem , 2014, Discret. Math..

[7]  Carsten Thomassen,et al.  Graphs in which every finite path is contained in a circuit , 1973 .

[8]  L. Lovász.  Three short proofs in graph theory , 1975 .

[9]  Alexandr V. Kostochka,et al.  Spanning trees with pairwise nonadjacent endvertices , 1997, Discret. Math..

[10]  Bruce A. Reed,et al.  A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω , 2016, J. Graph Theory.

[11]  Xuding Zhu,et al.  On-Line List Colouring of Graphs , 2009, Electron. J. Comb..

[12]  Bruce A. Reed,et al.  Claw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$ , 2015, J. Graph Theory.

[13]  James M. Carraher,et al.  Three Topics in Online List Coloring , 2014 .

[14]  J. Schmerl.  The Effective Version of Brooks' Theorem , 1982, Canadian Journal of Mathematics.

[15]  Béla Bollobás,et al.  Optimal Vertex Partitions , 1979 .

[16]  Paul A. Catlin.  Brooks' graph-coloring theorem and the independence number , 1979, J. Comb. Theory, Ser. B.

[17]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[18]  Alexandr V. Kostochka,et al.  Variable degeneracy: extensions of Brooks' and Gallai's theorems , 2000, Discret. Math..

[19]  Helge Tverberg.  On Schmerl's effective version of Brooks' theorem , 1984, J. Comb. Theory, Ser. B.

[20]  Noga Alon,et al.  Colorings and orientations of graphs , 1992, Comb..

[21]  A. Hajnal,et al.  On decomposition of graphs , 1967 .

[22]  Landon Rabern,et al.  On hitting all maximum cliques with an independent set , 2009, J. Graph Theory.

[23]  Landon Rabern.  A Different Short Proof of Brooks’ Theorem , 2014, Discuss. Math. Graph Theory.

[24]  Alexandr V. Kostochka,et al.  Lower bound of the hadwiger number of graphs by their average degree , 1984, Comb..

[25]  Yet another proof of Brooks' theorem , 2014, 1409.6812.

[26]  Uwe Schauz,et al.  Mr. Paint and Mrs. Correct , 2009, Electron. J. Comb..

[27]  Alexandr V. Kostochka,et al.  The colour theorems of Brooks and Gallai extended , 1996, Discret. Math..

[28]  B. Toft,et al.  Brooks's Theorem , 2015 .

[29]  G. A. Dirac,et al.  A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger , 1957 .

[30]  László Lovász.  On decomposition of graphs , 1966 .

[31]  J. Ponstein.  A new proof of Brooks's chromatic number theorem for graphs , 1969 .

[32]  Alexandr V. Kostochka,et al.  On an upper bound of a graph's chromatic number, depending on the graph's degree and density , 1977, J. Comb. Theory B.

[33]  Paul A. Catlin,et al.  Hajós' graph-coloring conjecture: Variations and counterexamples , 1979, J. Comb. Theory, Ser. B.

[34]  Jean-Sébastien Sereni,et al.  Subcubic triangle‐free graphs have fractional chromatic number at most 14/5 , 2013, J. Lond. Math. Soc..

[35]  V. G. Vizing,et al.  New proof of brooks' theorem , 1969 .

[36]  John Mitchem.  A short proof of Catlin's extension of Brooks' theorem , 1978, Discret. Math..

[37]  Katherine Edwards,et al.  Bounding the Fractional Chromatic Number of KDelta-Free Graphs , 2012, SIAM J. Discret. Math..

[38]  Jan Hladký,et al.  Brooks' Theorem via the Alon-Tarsi Theorem , 2010, Discret. Math..

[39]  Daniel W. Cranston,et al.  List-Coloring Claw-Free Graphs with Δ-1 Colors , 2017, SIAM J. Discret. Math..

[40]  B. Reed.  ω, Δ, and χ , 1998 .

[41]  Bruce A. Reed,et al.  Colouring graphs when the number of colours is nearly the maximum degree , 2001, STOC '01.

[42]  Landon Rabern.  Coloring Graphs from Almost Maximum Degree Sized Palettes , 2013 .

[43]  J. Bondy.  Short proofs of classical theorems , 2003 .

[44]  Uwe Schauz,et al.  A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of k-partite k-uniform Hypergraphs , 2010, Electron. J. Comb..

[45]  Katherine Edwards,et al.  Bounding the fractional chromatic number of KΔ-free graphs , 2012, arXiv.org.

[46]  Daniel W. Cranston,et al.  Painting Squares in 2 1 Shades , 2014 .

[47]  A. V. Kostochkaa,et al.  On equitable -coloring of graphs with low average degree , 2005 .

[48]  Uwe Schauz,et al.  Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants , 2010, Electron. J. Comb..

[49]  Linyuan Lu,et al.  A Fractional Analogue of Brooks' Theorem , 2011, SIAM J. Discret. Math..

[50]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[51]  Brendan D. McKay.  A Note on the History of the Four-Colour Conjecture , 2013, J. Graph Theory.

[52]  Katherine Edwards,et al.  A Superlocal Version of Reed's Conjecture , 2014, Electron. J. Comb..

[53]  Alexandr V. Kostochka,et al.  Ore's conjecture on color-critical graphs is almost true , 2012, J. Comb. Theory, Ser. B.

[54]  Michael Stiebitz,et al.  The forest plus stars colouring problem , 1994, Discrete Mathematics.

[55]  Bruce A. Reed,et al.  A Strengthening of Brooks' Theorem , 1999, J. Comb. Theory B.

[56]  Andrew D. King.  Hitting all maximum cliques with a stable set using lopsided independent transversals , 2009, J. Graph Theory.

[57]  Bruce A. Reed,et al.  A short proof that $\chi$ can be bounded $\epsilon$ away from $\Delta+1$ towards $\omega$ , 2012 .

[58]  B. Reed.  Graph Colouring and the Probabilistic Method , 2001 .

[59]  Stefan Hougardy,et al.  Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth , 1998, Combinatorics, Probability and Computing.

[60]  Victor Bryant.  A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem , 1996, Discret. Math..