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

Runrun Liu, Xiangwen Li. Every planar graph without adjacent cycles of length at most 8 is 3-choosable. Eur. J. Comb., 82, 2019. [doi]

Abstract

Abstract is missing.