On acyclic colorings of planar graphs. (Reprint)

DOI10.1016/j.disc.2006.03.017zbMath1093.05022OpenAlexW1972168259MaRDI QIDQ2497996

Oleg V. Borodin

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.017

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Acyclic coloring with few division vertices, Acyclic colorings of graph subdivisions revisited, Acyclic 4-choosability of planar graphs without 4-cycles, Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs

Cites Work

• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• Graphs with forbidden subgraphs
• Note on a paper of B. Grünbaum on acyclic colorings
• On Partitioning Planar Graphs
• The Point-Arboricity of Planar Graphs
• $B$-sets and coloring problems
• The Point Partition Numbers of Closed 2-Manifolds
• Acyclic colorings of planar graphs