Acyclic 5-choosability of planar graphs without 4-cycles

The conjecture on the acyclic 5-choosability of planar graphs (Borodin et al., 2002) as yet has been verified only for several restricted classes of graphs: those of girth at least 5 (Montassier, Ochem, and Raspaud, 2006), without 4- and 5-cycles or without 4- and 6-cycles (Montassier, Raspaud, and Wang, 2007), with neither 4-cycles nor chordal 6-cycles (Zhang and Xu, 2009), with neither 4- cycles nor two 3-cycles at distance less than 3 (Chen and Wang, 2008), and with neither 4-cycles nor intersecting 3-cycles (Chen and Raspaud, 2010). Wang and Chen (2009) proved that the planar graphs without 4-cycles are acyclically 6-choosable. We prove that a planar graph without 4-cycles is acyclically 5-choosable, which is a common strengthening of all above-mentioned results.

[1]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[2]  Oleg V. Borodin,et al.  Acyclic 5-choosability of planar graphs without adjacent short cycles , 2011, J. Graph Theory.

[3]  André Raspaud,et al.  On fans in multigraphs , 2006 .

[4]  Hervé Hocquard,et al.  Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable , 2009, Inf. Process. Lett..

[5]  André Raspaud,et al.  Acyclic list 7‐coloring of planar graphs , 2002, J. Graph Theory.

[6]  Min Chen,et al.  On acyclic 4-choosability of planar graphs without short cycles , 2010, Discret. Math..

[7]  Min Chen,et al.  Acyclic 5-choosability of planar graphs without 4-cycles , 2008, Discret. Math..

[8]  André Raspaud,et al.  Acyclic 4-Choosability of Planar Graphs Without Cycles of Specific Lengths , 2006 .

[9]  Oleg V. Borodin,et al.  On acyclic colorings of planar graphs , 2006, Discret. Math..

[10]  Carsten Thomassen,et al.  Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[11]  Oleg V. Borodin,et al.  Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles , 2013, J. Graph Theory.

[12]  Mickaël Montassier Acyclic 4-choosability of Planar Graphs with Girth at Least 5 , 2006 .

[13]  André Raspaud,et al.  Acyclic 5-choosability of planar graphs without small cycles , 2007 .

[14]  Min Chen,et al.  Planar graphs without 4-cycles are acyclically 6-choosable , 2009 .

[15]  J. Mitchem Every planar graph has an acyclic $8$-coloring , 1974 .

[16]  Min Chen,et al.  A sufficient condition for planar graphs to be acyclically 5-choosable , 2012, J. Graph Theory.

[17]  André Raspaud,et al.  Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles , 2010, Discret. Math..

[18]  D. R. Woodall,et al.  Acyclic Colourings of Planar Graphs with Large Girth , 1999 .

[19]  B. Grünbaum Acyclic colorings of planar graphs , 1973 .

[20]  Min Chen,et al.  Acyclic 3-choosability of sparse graphs with girth at least 7 , 2010, Discret. Math..

[21]  Alexandr V. Kostochka,et al.  Note to the paper of Grünbaum on acyclic colorings , 1976, Discret. Math..

[22]  Jaroslav Nesetril,et al.  Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.

[23]  M. Albertson,et al.  Every planar graph has an acyclic 7-coloring , 1977 .

[24]  A. V. Kostov cka Acyclic $6$-coloring of planar graphs , 1976 .