On 3-choosable planar graphs of girth at least 4

DOI10.1016/j.disc.2008.05.055zbMath1221.05150OpenAlexW1984035914MaRDI QIDQ1025501

Xiangwen Li

Publication date: 19 June 2009

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

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

zbMATH Keywords

planar graphscolorabilitylisting 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

3-list-coloring planar graphs of girth 4 ⋮ On 3-choosability of triangle-free plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• The complexity of planar graph choosability
• Colorings and orientations of graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• A short list color proof of Grötzsch's theorem
• Smaller planar triangle-free graphs that are not 3-list-colorable
• On structure of some plane graphs with application to choosability
• Hajós' theorem for list coloring
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Bordeaux 3-color conjecture and 3-choosability
• Grötzsch's theorem on 3-colorings
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles