期刊论文

Liu, Runrun

英文

Discrete Mathematics

0012-365X

2019

342

3

623-627

10.1016/j.disc.2018.10.025

The second author was supported in part by the NSFC ( 11728102 ) and the NSFC ( 11571134 ).

本校为第一且通讯机构

Wang and Lih (2002) conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results of Lam et al. (1999), Cheng et al. (2016) and Kim and Yu [arXiv:1709.09809v1]. (C)...