Algorithmic Aspects of Acyclic Edge Colorings

AbstractA proper coloring of the edges of a graph G is called acyclic if there is no two-colored cycle in G . The acyclic edge chromatic number of G , denoted by a'(G) , is the least number of colors in an acyclic edge coloring of G . For certain graphs G , a'(G)\geq Δ(G)+2 where Δ(G) is the maximum degree in G . It is known that a'(G)≤ Δ + 2 for almost all Δ -regular graphs, including all Δ -regular graphs whose girth is at least cΔ log Δ . We prove that determining the acyclic edge chromatic number of an arbitrary graph is an NP-complete problem. For graphs G with sufficiently large girth in terms of Δ(G) , we present deterministic polynomial-time algorithms that color the edges of G acyclically using at most Δ(G)+2 colors.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Penny Haxell,et al.  A Note on Vertex List Colouring , 2001, Combinatorics, Probability and Computing.

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

[5]  Jayadev Misra,et al.  A Constructive Proof of Vizing's Theorem , 1992, Inf. Process. Lett..

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

[7]  Bela Bollobas,et al.  Graph theory , 1979 .

[8]  Zvi Galil,et al.  NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.

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

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

[11]  Noga Alon.  The String Chromatic Number of a Graph , 1992, Random Struct. Algorithms.

[12]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

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