Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable

Yingqian Wang, Qian Wu, Liang Shen

Source record

Source: Crossref

Published: Feb 1, 2011

DOI: 10.1016/j.dam.2010.11.002

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.