论文信息 - Acyclically 3-Colorable Planar Graphs

Acyclically 3-Colorable Planar Graphs

In this paper we study the planar graphs that admit an acyclic 3-coloring. We show that testing acyclic 3-colorability is $\cal NP$-hard for planar graphs of maximum degree 4 and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such that every 3-coloring is acyclic and we provide a linear-time recognition algorithm for such graphs.

Fabrizio Frati | Patrizio Angelini

[1] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .

[2] M. Albertson,et al. Every planar graph has an acyclic 7-coloring , 1977 .

[3] D. R. Woodall,et al. Acyclic Colourings of Planar Graphs with Large Girth , 1999 .

[4] Eugene L. Lawler,et al. The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[5] J. Mitchem. Every planar graph has an acyclic $8$-coloring , 1974 .

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

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

[8] K. Appel,et al. Every planar map is four colorable. Part II: Reducibility , 1977 .

[9] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .

[10] A. V. Kostov cka. Acyclic $6$-coloring of planar graphs , 1976 .

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

[12] Alexandr V. Kostochka,et al. Total Colourings of Planar Graphs with Large Girth , 1998, Eur. J. Comb..

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

[14] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[15] Robin Thomas,et al. Efficiently four-coloring planar graphs , 1996, STOC '96.

[16] David R. Wood,et al. Acyclic, Star and Oriented Colourings of Graph Subdivisions , 2005, Discret. Math. Theor. Comput. Sci..