Acyclically 3-colorable planar graphs

  title={Acyclically 3-colorable planar graphs},
  author={Patrizio Angelini and Fabrizio Frati},
  journal={J. Comb. Optim.},
In this paper we study the planar graphs that admit an acyclic 3-coloring. We show that testing acyclic 3-colorability is NP-hard, even 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 admits an acyclic 3-coloring. Finally, we show that every series-parallel graph admits an acyclic 3-coloring and we give a… CONTINUE READING
1 Extracted Citations
16 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 16 references

Upper Bounds of Chromatic Functions of Graphs

  • A. V. Kostochka
  • PhD thesis, University of Novosibirsk (in Russian…
  • 1978
2 Excerpts

Similar Papers

Loading similar papers…