A sufficient condition for planar graphs to be acyclically 5-choosable

DOI10.1002/jgt.20604zbMath1242.05089OpenAlexW1684925218MaRDI QIDQ2888884

Min Chen, Andre Raspaud

Publication date: 4 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20604

zbMATH Keywords

planar graphacyclic coloringintersecting trianglesacyclic choosability

Mathematics Subject Classification ID

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

Related Items (11)

Acyclic choosability of graphs with bounded degree ⋮ Construction of acyclically 4-colourable planar triangulations with minimum degree 4 ⋮ Acyclic coloring of graphs without bichromatic long path ⋮ Acyclic 4-choosability of planar graphs without intersecting short cycles ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ Acyclic 6-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 4-choosability of planar graphs without 4-cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic 4-choosability of planar graphs
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
• On acyclic 4-choosability of planar graphs without short cycles
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
• 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 is 5-choosable
• Every planar graph has an acyclic 8-coloring
• Acyclic 5-choosability of planar graphs without small cycles
• Planar graphs without 4-cycles are acyclically 6-choosable
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic list 7‐coloring of planar graphs
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic colorings of planar graphs

This page was built for publication: A sufficient condition for planar graphs to be acyclically 5-choosable