A note on 3-choosability of planar graphs

DOI10.16218/J.ISSN.1001-5051.2016.01.003MaRDI QIDQ2824705zbMATH OpenFDO

Authors Xiaoyan Li, Yingqian Wang

Publication date 6 October 2016

Published in Journal of Zhejiang Normal University. Natural Sciences (Search for Journal in Brave)

zbMATH Keywords

distancechoosabilitycyclesplanar graph

Mathematics Subject Classification ID

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

Recommendations

• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs
• Some structural properties of planar graphs and their applications to 3-choosability
• The 3-choosability of plane graphs without 8-, 9- and 10-cycles
• On 3-choosability of planar graphs without certain cycles

Cited in

(8)

• scientific article; zbMATH DE number 5914884 (Why is no real title available?)
• scientific article; zbMATH DE number 6873968 (Why is no real title available?)
• scientific article; zbMATH DE number 5064026 (Why is no real title available?)
• A note on 3-choosability of planar graphs related to Montanssier's conjecture
• A note on 3-choosability of planar graphs
• Note on 3-choosability of planar graphs with maximum degree 4
• DP-3-coloring of planar graphs without certain cycles
• scientific article; zbMATH DE number 6671710 (Why is no real title available?)

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