Acyclic list 7‐coloring of planar graphs

2002/04/15 by O. V. Borodin, D. G. Fon‐Der Flaass, A.V. Kostochka +5 · 3 citations
Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Graph Labeling and Dimension Problems

paper · doi:10.1002/jgt.10035

openalex publication_date 2002/04/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Abstract The acyclic list chromatic number of every planar graph is proved to be at most 7. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002

Cited by

• Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
• Planar graphs without 4‐cycles are acyclically 6‐choosable
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable

Related

• Acyclic List Colouring Locally Planar Graphs
• A new upper bound on the acyclic chromatic indices of planar graphs
• An improved bound on acyclic chromatic index of planar graphs
• Acyclic Edge coloring of Planar Graphs
• Planar graphs without 4‐cycles are acyclically 6‐choosable