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

From MaRDI portal
Publication:2323250

DOI10.1016/j.ejc.2019.07.006zbMath1423.05072arXiv1804.03976OpenAlexW2963907918WikidataQ127493015 ScholiaQ127493015MaRDI QIDQ2323250

Runrun Liu, Xiangwen Li

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.03976




Related Items (5)




Cites Work




This page was built for publication: Every planar graph without adjacent cycles of length at most 8 is 3-choosable