A note on the acyclic 3-choosability of some planar graphs

DOI10.1016/J.DAM.2010.02.005zbMath1220.05040OpenAlexW4366084475MaRDI QIDQ708344

Mickaël Montassier, Hervé Hocquard, Andre Raspaud

Publication date: 11 October 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.02.005

zbMATH Keywords

acyclic coloringforbidden cyclessparse triangles

Mathematics Subject Classification ID

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

Related Items (2)

(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles

Cites Work

• Unnamed Item
• Acyclic 3-choosability of sparse graphs with girth at least 7
• A non-3-choosable planar graph without cycles of length 4 and 5
• Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
• Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
• On acyclic colorings of planar graphs
• Every planar graph is 5-choosable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Acyclic list 7‐coloring of planar graphs
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• On the acyclic choosability of graphs
• 25 pretty graph colouring problems

This page was built for publication: A note on the acyclic 3-choosability of some planar graphs