Acyclic choosability of planar graphs: a Steinberg like approach

DOI10.1016/j.endm.2009.07.033zbMath1273.05047OpenAlexW2076500039MaRDI QIDQ2851463

Hervé Hocquard, Mickaël Montassier

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.033

zbMATH Keywords

planar graphslist coloringforbidden cyclesacyclic choosabilitylist assignment

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• 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
• Acyclic 5-choosability of planar graphs without 4-cycles

This page was built for publication: Acyclic choosability of planar graphs: a Steinberg like approach