期刊论文

Li, Xiangwen

英文

European Journal of Combinatorics

0195-6698

2019

82

102995

10.1016/j.ejc.2019.07.006

Supported in part by the NSF of China (11571134). The authors thank Gexin Yu for the valuable suggestions which improved the presentation.

本校为第一且通讯机构

DP-coloring as a generalization of list coloring was introduced by Dvorak and Postle in 2017, who proved that every planar graph without cycles from 4 to 8 is 3-choosable, which was conjectured by Borodin et al. in 2007. In this paper, we prove that every planar graph without adjacent cycles of length at most 8 is 3-choosable, which extends this result of Dvorak and P...