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

Runrun Liu Xiangwen Li

Published in: Eur. J. Comb. (2019)

Keyphrases

planar graphs
upper bound
approximate inference