A note on 3-choosability of planar graphs

DOI10.16218/J.ISSN.1001-5051.2016.01.003zbMATH Open1363.05050MaRDI QIDQ2824705FDOQ2824705

Authors: Xiaoyan Li, Yingqian Wang 

Publication date: 6 October 2016

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

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

zbMATH Keywords

distancechoosabilitycyclesplanar graph

Mathematics Subject Classification ID

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

Cited In (8)

• A note on 3-choosability of planar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Note on 3-choosability of planar graphs with maximum degree 4
• A note on 3-choosability of planar graphs related to Montanssier's conjecture
• 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 Q2824705)