Every planar graph without adjacent cycles of length at most 8 is 3-choosable

Runrun Liu, Xiangwen Li

Source record

Source: Crossref

Published: Dec 1, 2019

DOI: 10.1016/j.ejc.2019.07.006

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.