A note on 3-choosability of planar graphs related to Montanssier's conjecture

DOI10.4153/CMB-2015-040-0MaRDI QIDQ2810722zbMATH OpenWikidataFDO

Authors Haihui Zhang

Publication date 3 June 2016

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

choosabilitycycleplanar graphcycle choosability

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

• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs
• On \((3, r)\)-choosability of some planar graphs
• A note on 3-choosability of planar graphs without certain cycles
• A note on the acyclic 3-choosability of some planar graphs
• 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
• A \((3,1)^\ast\)-choosable theorem on planar graphs

Cited in

(1)

• DP-3-coloring of planar graphs without certain cycles

This page was built for publication: A note on 3-choosability of planar graphs related to Montanssier's conjecture

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