I, F-partitions of sparse graphs

A star $k$-coloring is a proper $k$-coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-colorable. One method to produce a star 4-coloring is to partition the vertex set into a 2-independent set and a forest; such a partition is called an I,F-partition. We use a combination of potential functions and discharging to prove that every graph with maximum average degree less than $\frac{5}{2}$ has an I,F-partition, which is sharp and answers a question of Cranston and West [A guide to the discharging method, arXiv:1306.4434]. This result implies that planar graphs of girth at least 10 are star 4-colorable, improving upon previous results of Bu, Cranston, Montassier, Raspaud, and Wang [Star coloring of sparse graphs, J. Graph Theory 62 (2009), 201-219].

[1]  Craig Timmons.  Star Coloring High Girth Planar Graphs , 2008, Electron. J. Comb..

[2]  K. Appel,et al.  Every planar map is four colorable. Part II: Reducibility , 1977 .

[3]  André Raspaud,et al.  Star coloring of sparse graphs , 2009, J. Graph Theory.

[4]  Wayne Goddard,et al.  Acyclic colorings of planar graphs , 1991, Discret. Math..

[5]  Oleg V. Borodin,et al.  Colorings of plane graphs: A survey , 2013, Discret. Math..

[6]  Alexandr V. Kostochka,et al.  Ore’s conjecture for k=4 and Grötzsch’s Theorem , 2014, Combinatorica.

[7]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[8]  André Kündgen,et al.  Star coloring planar graphs from small lists , 2010, J. Graph Theory.

[9]  Min Chen,et al.  Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2 , 2015, J. Comb. Theory, Ser. B.

[10]  Alexandr V. Kostochka,et al.  A Brooks-Type Result for Sparse Critical Graphs , 2014, Comb..

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

[12]  Glenn G. Chappell,et al.  Coloring with no 2-Colored P4's , 2004, Electron. J. Comb..

[13]  Oleg V. Borodin.  On acyclic colorings of planar graphs , 1979, Discret. Math..

[14]  Hal A. Kierstead,et al.  Star coloring bipartite planar graphs , 2009, J. Graph Theory.

[15]  K. Appel,et al.  Every planar map is four colorable. Part I: Discharging , 1977 .

[16]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[17]  Alexandr V. Kostochka,et al.  On 11-improper 22-coloring of sparse graphs , 2013, Discret. Math..

[18]  Daniel W. Cranston,et al.  An introduction to the discharging method via graph coloring , 2013, Discret. Math..