On acyclic colorings of planar graphs

1979/01/01 by O. V. Borodin, O.V. Borodin · 9 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Conjecture #Discrete mathematics #Edge coloring #Graph #Graph Labeling and Dimension Problems #Graph coloring #Graph power #Limits and Structures in Graph Theory #Line graph #Mathematics #Planar graph #Vertex (graph theory)

paper · pdf · doi:10.1016/0012-365x(79)90077-3

crossref issued 1979/01/01 · crossref published 1979/01/01 · crossref published-print 1979/01/01 · openalex publication_date 1979/01/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/07/28 · openalex updated_date 2026/07/31

Citations

• Every planar graph has an acyclic 8-coloring
• B-sets and coloring problems
• Acyclic colorings of planar graphs

Cited by

• Acyclic Vertex Coloring of Graphs of Maximum Degree Six
• Acyclic colorings of subcubic graphs
• Acyclic coloring of graphs of maximum degree five: Nine colors are enough
• Layout of Graphs with Bounded Tree-Width
• Star arboricity of graphs
• Nonrepetitive Colorings of GraphsA Survey
• Acyclic colourings of graphs with obstructions
• Nonrepetitive colouring via entropy compression
• Acyclic coloring [wikipedia]