Acyclic edge colorings of graphs

A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a0(G), is the least number of colors in an acyclic edge coloring of G. For certain graphs G, a0(G) D(G)‡ 2 where D(G) is the maximum degree in G. It is known that a0(G) 16 D(G) for any graph G. We prove that

[1]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

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

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

[4]  F. Harary,et al.  The theory of graphs and its applications , 1963 .

[5]  Nicholas C. Wormald,et al.  Almost All Regular Graphs Are Hamiltonian , 1994, Random Struct. Algorithms.

[6]  Noga Alon,et al.  A parallel algorithmic version of the local lemma , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[7]  David G. Wagner.  On the perfect one - factorization conjecture , 1992, Discret. Math..

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

[9]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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