Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable

DOI10.1016/j.dam.2010.11.002zbMath1210.05029OpenAlexW2007868302MaRDI QIDQ629363

Liang Shen, Qian Wu, Ying Qian Wang

Publication date: 9 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.002

zbMATH Keywords

cycleplanar graphcoloringchoosability

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

Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs ⋮ 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 ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ 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
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• The complexity of planar graph choosability
• Every planar graph is 5-choosable
• 3-list-coloring planar graphs of girth 5
• 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
• Unnamed Item