On 3-choosable planar graphs of girth at least 4

DOI10.1016/J.DISC.2008.05.055MaRDI QIDQ1025501zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• 3-list-coloring planar graphs of girth 4
• On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles
• The 3-choosability of plane graphs without 3-,6-,9-and 10-cycles
• Planar graphs without intersecting 5-cycles are 4-choosable
• The 4-choosability of plane graphs without 4-cycles

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3482373 (Why is no real title available?)
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• A short list color proof of Grötzsch's theorem
• Bordeaux 3-color conjecture and 3-choosability
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• Graph theory
• Grötzsch's theorem on 3-colorings
• Hajós' theorem for list coloring
• List colourings of planar graphs
• Multicriterial graph problems with MAXMIN criterion
• On structure of some plane graphs with application to choosability
• Smaller planar triangle-free graphs that are not 3-list-colorable
• The 4-choosability of plane graphs without 4-cycles
• The complexity of planar graph choosability

Cited in

(2)

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

This page was built for publication: On 3-choosable planar graphs of girth at least 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025501)