Acyclically 3-Colorable Planar Graphs

DOI10.1007/978-3-642-11440-3_11zbMath1274.05142OpenAlexW1583540866MaRDI QIDQ3404434

Fabrizio Frati, Patrizio Angelini

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_11

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Acyclic colorings of graph subdivisions revisited ⋮ Acyclically 3-colorable planar graphs

This page was built for publication: Acyclically 3-Colorable Planar Graphs