A note on 3-choosability of planar graphs

zbMATH Open1224.05173MaRDI QIDQ3073243FDOQ3073243

Authors: Ying Han 

Publication date: 5 February 2011

Recommendations

• On 3-choosability of planar graphs without certain cycles
• On 3-choosability of planar graphs without certain cycles
• A note on 3-choosability of plane graphs under distance restrictions
• A note on 3-choosability of planar graphs
• On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles

zbMATH Keywords

choosabilitycycleplanar graph

Mathematics Subject Classification ID

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

Cited In (12)

• A note on 3-choosability of planar graphs
• Title not available (Why is that?)
• A not 3-choosable planar graph without 3-cycles
• Title not available (Why is that?)
• Planar graphs that have non short cycles with a chord are 3-choosable
• Title not available (Why is that?)
• A note on 3-choosability of planar graphs related to Montanssier's conjecture
• A note on the not 3-choosability of some families of planar graphs
• Adaptable choosability of planar graphs with sparse short cycles
• On 3-choosability of planar graphs without certain cycles
• On 3-choosability of planar graphs without certain cycles
• DP-3-coloring of planar graphs without certain cycles

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 Q3073243)