Acyclic chromatic indices of planar graphs with girth at least five

An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of G is the smallest integer k such that G has an acyclic edge coloring using k colors. Fiamik (Math. Slovaca 28 (1978), 139–145) and later Alon et al. (J Graph Theory 37 (2001), 157–167) conjectured that for any simple graph G with maximum degree Δ. In this article, we confirm this conjecture for planar graphs of girth at least 4.

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

[2]  Noga Alon,et al.  Acyclic edge colorings of graphs , 2001 .

[3]  Manu Basavaraju,et al.  Acyclic edge-colorings of planar graphs , 2011 .

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

[5]  Roman Soták,et al.  Acyclic edge coloring of planar graphs with Δ colors , 2012, Discret. Appl. Math..

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

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

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

[9]  Nathann Cohen,et al.  Acyclic edge-colouring of planar graphs , 2009 .

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

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

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

[13]  Bin Liu,et al.  Acyclic edge chromatic number of outerplanar graphs , 2010 .

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

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

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

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

[18]  Nathann Cohen,et al.  Acyclic edge-colouring of planar graphs. Extended abstract , 2009, Electron. Notes Discret. Math..