On 3-choosability of triangle-free plane graphs

DOI10.1007/S11425-011-4191-ZzbMath1228.05160OpenAlexW2000960231MaRDI QIDQ657261

Qijun Zhang, Ying Qian Wang

Publication date: 16 January 2012

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-011-4191-z

zbMATH Keywords

trianglecyclecoloringplane graphchoosability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• On 3-choosable planar graphs of girth at least 4
• Colorings and orientations of graphs
• A short list color proof of Grötzsch's theorem
• A not 3-choosable planar graph without 3-cycles

This page was built for publication: On 3-choosability of triangle-free plane graphs