论文信息 - Acyclic edge chromatic number of outerplanar graphs

Acyclic edge chromatic number of outerplanar graphs

A proper edge coloring 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 χ ′a (G), is the least number of colors in an acyclic edge coloring of G. In this paper, we determine completely the acyclic edge chromatic number of outerplanar graphs. The proof is constructive and supplies a polynomial time algorithm to acyclically color the edges of any outerplanar graph G using χ ′a (G) colors. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 22–36, 2010

Bin Liu | Jianfeng Hou | Jian-Liang Wu | Guizhen Liu

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

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

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

[4] C. R. Subramanian,et al. Improved bounds on acyclic edge colouring , 2007, Discret. Math..

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

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

[7] Noga Alon,et al. Algorithmic Aspects of Acyclic Edge Colorings , 2001, Algorithmica.

[8] C. R. Subramanian,et al. Optimal Acyclic Edge Colouring of Grid Like Graphs , 2006, COCOON.

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

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

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

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