Planar graphs that have non short cycles with a chord are 3-choosable

DOI10.11650/TWJM/1500404644zbMath1155.05027OpenAlexW1561288928MaRDI QIDQ2470800

Weifang Wang

Publication date: 15 February 2008

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500404644

zbMATH Keywords

cyclechromatic numberplanar graphvertexchoosable graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Planar graphs that have non short cycles with a chord are 3-choosable