Brooks' theorem for 2-fold coloring


  • Jacob Anthony White University of Texas Rio Grande Valley


Graph Coloring, Brook's Theorem, 2-fold coloring


The two-fold chromatic number of a graph is the minimum number of colors needed to ensure that there is a way to color the graph so that each vertex gets two distinct colors, and adjacent vertices have no colors in common. The Ore degree is the maximum sum of degrees of an edge in a graph. We prove that, for 2-connected graphs, the two-fold chromatic number is at most the Ore degree, unless G is a complete graph or an odd cycle.


O. V. Borodin and A. V. Kostochka. On an upper bound of a graph’s chromatic number,depending on the graph’s degree and density.J. Combinatorial Theory Ser. B, 23(2-3):247–250, 1977.

R. L. Brooks. On colouring the nodes of a network.Proc. Cambridge Philos. Soc., 37:194–197,1941.

D. Christofides, K. Edwards, and A. D. King. A note on hitting maximum and maximalcliques with a stable set. J. Graph Theory, 73(3):354–360, 2013.

K. Edwards and A. D. King. Bounding the fractional chromatic number ofK∆-free graphs.SIAM J. Discrete Math., 27(2):1184–1208, 2013.

P. Erd ̋os, A. L. Rubin, and H. Taylor. Choosability in graphs. InProceedings of the WestCoast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ.,Arcata, Calif., 1979), Congress. Numer., XXVI, pages 125–157. Utilitas Math., Winnipeg,Man., 1980.

H. A. Kierstead and A. V. Kostochka. Ore-type versions of Brooks’ theorem.J. Combin.Theory Ser. B, 99(2):298–305, 2009.

L. Rabern. ∆-critical graphs with small high vertex cliques.J. Combin. Theory Ser. B,102(1):126–130, 2012.

U. Schauz. Mr. Paint and Mrs. Correct.Electron. J. Combin., 16(1):Research Paper 77, 18,2009.

E. R. Scheinerman and D. H. Ullman.Fractional graph theory. Wiley-Interscience Series inDiscrete Mathematics and Optimization. John Wiley & Sons, Inc., New York, 1997. A rationalapproach to the theory of graphs, With a foreword by Claude Berge, A Wiley-IntersciencePublication.

X. Zhu. On-line list colouring of graphs.Electron. J. Combin., 16(1):Research Paper 127, 16,2009