Acyclically 3-colorable planar graphs

In this paper we study the acyclic 3-colorability of some subclasses of planar graphs. First, we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Then, we show that every planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable and provide a linear-time coloring algorithm. Finally, we characterize the series-parallel graphs for which every 3-coloring is acyclic and provide a linear-time recognition algorithm for such graphs.

[1]  T. Coleman,et al.  The cyclic coloring problem and estimation of spare hessian matrices , 1986 .

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

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

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

[5]  Fabrizio Frati,et al.  Acyclically 3-Colorable Planar Graphs , 2010, WALCOM.

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

[7]  A. Pothen,et al.  Graph Coloring in Optimization Revisited , 2008 .

[8]  Andrea Walther,et al.  Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation , 2009, INFORMS J. Comput..

[9]  Pascal Ochem.  Negative results on acyclic improper colorings , 2005 .

[10]  Oleg V. Borodin.  On acyclic colorings of planar graphs , 1979, Discret. Math..

[11]  Lenwood S. Heath,et al.  Laying out Graphs Using Queues , 1992, SIAM J. Comput..

[12]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

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

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

[15]  Pat Morin,et al.  Layout of Graphs with Bounded Tree-Width , 2004, SIAM J. Comput..

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

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

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

[19]  Arnold L. Rosenberg,et al.  Comparing Queues and Stacks as Mechanisms for Laying out Graphs , 1992, SIAM J. Discret. Math..

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

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

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

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

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

[25]  David R. Wood,et al.  Track Layouts of Graphs , 2004, Discret. Math. Theor. Comput. Sci..