A sufficient condition for a planar graph to be 3-choosable

DOI10.1016/j.ipl.2007.06.005zbMath1183.05022OpenAlexW2031219849MaRDI QIDQ2380013

Liang Shen, Ying Qian Wang

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.06.005

zbMATH Keywords

cyclecombinatorial problemsplanar graphchoosability

Mathematics Subject Classification ID

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

Related Items (9)

A note on 3-choosability of planar graphs ⋮ Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable ⋮ Some structural properties of planar graphs and their applications to 3-choosability ⋮ Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate ⋮ DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Planar graphs without specific cycles are 2-degenerate ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles ⋮ Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable

Cites Work

• List colourings of planar graphs
• A note on the not 3-choosability of some families of planar graphs
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• The 3-choosability of plane graphs of girth 4
• 3-list-coloring planar graphs of girth 5
• Bordeaux 3-color conjecture and 3-choosability
• A note on 3-choosability of planar graphs without certain cycles

This page was built for publication: A sufficient condition for a planar graph to be 3-choosable