Acyclic colorings of planar graphs

1973/12/01 by Branko Grünbaum · 13 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Arboricity #Combinatorics #Complete coloring #Computational Geometry and Mesh Generation #Conjecture #Discrete mathematics #Edge coloring #Graph #Graph coloring #Graph power #Greedy coloring #Line graph #List coloring #Mathematics #Planar graph #graph theory and CDMA systems

paper · doi:10.1007/bf02764716

crossref issued 1973/12/01 · crossref published 1973/12/01 · crossref published-print 1973/12/01 · openalex publication_date 1973/12/01 · crossref created 2007/12/02 · crossref deposited 2019/05/19 · openalex created_date 2025/10/10 · crossref indexed 2026/07/28 · openalex updated_date 2026/07/29

Citations

• The Four Color Problem
• Graph Theory and Probability

Cited by

• New bounds for the acyclic chromatic index
• Acyclic Vertex Coloring of Graphs of Maximum Degree Six
• Acyclic edge colorings of graphs
• Improved bounds on acyclic edge colouring
• On acyclic colorings of planar graphs
• Acyclic colorings of subcubic graphs
• Acyclic edge colourings of graphs with large girth
• Graphs with maximum degree 5 are acyclically 7-colorable
• Acyclic coloring of graphs of maximum degree five: Nine colors are enough
• Layout of Graphs with Bounded Tree-Width
• Acyclic colourings of graphs with obstructions
• Acyclic coloring [wikipedia]
• Glossary of graph theory [wikipedia]