Planar graphs without 3-, 7-, and 8-cycles are 3-choosable

DOI10.1016/j.disc.2009.04.010zbMath1213.05076OpenAlexW2084405650MaRDI QIDQ1045077

Bernard Lidický, Riste Škrekovski, Zdeněk Dvořák

Publication date: 15 December 2009

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

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

zbMATH Keywords

planar graphschoosabilityshort cycleslist-coloring

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

Planar graphs without normally adjacent short cycles ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Note on 3-choosability of planar graphs with maximum degree 4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• The 3-choosability of plane graphs of girth 4
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Bordeaux 3-color conjecture and 3-choosability