A note on 3-choosability of planar graphs

DOI10.1016/J.IPL.2007.08.027MaRDI QIDQ2380076zbMATH OpenOpenAlexFDO

Authors Ming Chen, Yingqian Wang, Hua Jing Lu

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.08.027

zbMATH Keywords

choosabilitycycleplanar graphcombinatorial problems

Mathematics Subject Classification ID

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

Recommendations

• A note on 3-choosability of planar graphs without certain cycles
• Some structural properties of planar graphs and their applications to 3-choosability
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• A non-3-choosable planar graph without cycles of length 4 and 5
• A note on 3-choosability of planar graphs without certain cycles
• A note on the not 3-choosability of some families of planar graphs
• A sufficient condition for a planar graph to be 3-choosable
• Bordeaux 3-color conjecture and 3-choosability
• Every planar graph is 5-choosable
• List colourings of planar graphs
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• The complexity of planar graph choosability

Cited in

(26)

• A note on 3-choosability of planar graphs without certain cycles
• scientific article; zbMATH DE number 6671710 (Why is no real title available?)
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
• 3-paintability of planar graphs
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
• scientific article; zbMATH DE number 5064026 (Why is no real title available?)
• Planar graphs that have non short cycles with a chord are 3-choosable
• scientific article; zbMATH DE number 6873968 (Why is no real title available?)
• Note on 3-choosability of planar graphs with maximum degree 4
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs related to Montanssier's conjecture
• The 3-choosability of plane graphs without 3-,6-,9-and 10-cycles
• A note on the not 3-choosability of some families of planar graphs
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
• A non-3-choosable planar graph without cycles of length 4 and 5
• A note on choosability with separation for planar graphs.
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• Corrigendum to ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles
• Some structural properties of planar graphs and their applications to 3-choosability
• On 3-choosability of planar graphs without certain cycles
• On 3-choosability of planar graphs without certain cycles
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• DP-3-coloring of planar graphs without certain cycles
• Planar graphs without specific cycles are 2-degenerate

This page was built for publication: A note on 3-choosability of planar graphs

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