Planar graphs without 4- and 5-cycles are acyclically 4-choosable

2012/11/22 by Min Chen, André Raspaud
Computer Science · #Advanced Graph Theory Research

paper · pdf · doi:10.1016/j.dam.2012.11.006

openalex publication_date 2012/11/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02

Citations

• A sufficient condition for planar graphs to be acyclically 5‐choosable
• Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
• Every planar graph has an acyclic 8-coloring
• Acyclic list 7‐coloring of planar graphs
• Planar graphs without 4‐cycles are acyclically 6‐choosable