A Note on 3-choosability of Planar Graphs Related to Montanssier’s Conjecture

DOI10.4153/CMB-2015-040-0zbMath1337.05045WikidataQ122877880 ScholiaQ122877880MaRDI QIDQ2810722

Haihui Zhang

Publication date: 3 June 2016

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

zbMATH Keywords

cycleplanar graphchoosabilitycycle choosability

Mathematics Subject Classification ID

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

Related Items (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