Some structural properties of planar graphs and their applications to 3-choosability

DOI10.1016/j.disc.2011.09.028zbMath1233.05164OpenAlexW1971430898MaRDI QIDQ658061

Mickaël Montassier, Min Chen, Andre Raspaud

Publication date: 11 January 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.028

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• List colourings of planar graphs
• A non-3-choosable planar graph without cycles of length 4 and 5
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• Every planar graph is 5-choosable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A sufficient condition for a planar graph to be 3-choosable
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs without certain cycles
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• 25 pretty graph colouring problems