A new upper bound on the acyclic chromatic indices of planar graphs

An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a^'(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. It was conjectured that a^'(G)@[email protected]+2 for any simple graph G with maximum degree @D. In this paper, we prove that if G is a planar graph, then a^'(G)@[email protected]+7. This improves a result by Basavaraju et al. [M. Basavaraju, L.S. Chandran, N. Cohen, F. Havet, T. Muller, Acyclic edge-coloring of planar graphs, SIAM J. Discrete Math. 25 (2011) 463-478], which says that every planar graph G satisfies a^'(G)@[email protected]+12.

[1]  Xiang-Yong Sun,et al.  Acyclic Edge Colorings of Planar Graphs Without Short Cycles ∗ , 2008 .

[2]  Manu Basavaraju,et al.  Acyclic edge coloring of graphs with maximum degree 4 , 2009, J. Graph Theory.

[3]  Bin Liu,et al.  Acyclic edge coloring of planar graphs with large girth , 2009, Theor. Comput. Sci..

[4]  Bruce A. Reed,et al.  Acyclic Coloring of Graphs , 1991, Random Struct. Algorithms.

[5]  Mariusz Haluszczak,et al.  About acyclic edge colourings of planar graphs , 2008, Inf. Process. Lett..

[6]  Wei-Fan Wang,et al.  Acyclic chromatic indices of planar graphs with girth at least five , 2010, Journal of Combinatorial Optimization.

[7]  Ping Wang,et al.  Acyclic chromatic indices of planar graphs with large girth , 2011, Discret. Appl. Math..

[8]  Jianfeng Hou,et al.  Acyclic Edge Coloring of Planar Graphs Without Small Cycles , 2012, Graphs Comb..

[9]  Bin Liu,et al.  Acyclic edge chromatic number of outerplanar graphs , 2010, Journal of Graph Theory.

[10]  Wei-Fan Wang,et al.  Acyclic chromatic indices of planar graphs with girth at least five , 2012, J. Comb. Optim..

[11]  Manu Basavaraju,et al.  Acyclic edge coloring of graphs with maximum degree 4 , 2009 .

[12]  Bin Liu,et al.  Acyclic edge colorings of planar graphs and seriesparallel graphs , 2009 .

[13]  Bruce A. Reed,et al.  Further algorithmic aspects of the local lemma , 1998, STOC '98.

[14]  Mieczyslaw Borowiecki,et al.  Acyclic edge colouring of planar graphs without short cycles , 2010, Discret. Math..

[15]  Manu Basavaraju,et al.  Acyclic edge coloring of subcubic graphs , 2008, Discret. Math..

[16]  Ko-Wei Lih,et al.  Choosability and edge choosability of planar graphs without five cycles , 2002, Appl. Math. Lett..

[17]  WeiFan Wang,et al.  Acyclic chromatic indices of K 4 -minor free graphs , 2011 .

[18]  San Skulrattanakulchai,et al.  Acyclic colorings of subcubic graphs , 2004, Inf. Process. Lett..

[19]  Wei-Fan Wang,et al.  Acyclic edge coloring of planar graphs without 4-cycles , 2012, Journal of Combinatorial Optimization.

[20]  Noga Alon,et al.  Acyclic edge colorings of graphs , 2001, J. Graph Theory.

[21]  Wei Dong,et al.  Some results on acyclic edge coloring of plane graphs , 2010, Inf. Process. Lett..

[22]  Manu Basavaraju,et al.  Acyclic Edge-Coloring of Planar Graphs , 2009, SIAM J. Discret. Math..

[23]  C. R. Subramanian,et al.  Acyclic Edge Colouring of Outerplanar Graphs , 2007, AAIM.

[24]  Jaroslav Nesetril,et al.  The acyclic edge chromatic number of a random d-regular graph is d + 1 , 2005, J. Graph Theory.