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

DOI10.1016/j.endm.2009.07.111zbMath1273.05061OpenAlexW2175372291MaRDI QIDQ2851536

Min Chen, Andre Raspaud

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.111

zbMATH Keywords

acyclic choosability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Acyclically 4-colorable triangulations ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 6-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ On acyclically 4-colorable maximal planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Note to the paper of Grünbaum on acyclic colorings
• Every planar graph has an acyclic 7-coloring
• On acyclic colorings of planar graphs
• Every planar graph has an acyclic 8-coloring
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic list 7‐coloring of planar graphs
• Acyclic colorings of planar graphs

This page was built for publication: Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable