Search

DP-coloring as a generalization of list coloring was introduced by Dvořák and Postle recently. In this paper, we prove that every planar graph in which the distance between 6 − -cycles is at least 2 is DP-3-colorable, which extends the result of Yin and Yu [Discret. Math. 2019, 342, 2333–2341]. [ABSTRACT FROM AUTHOR]

DP-coloring was introduced by Dvořák and Postle [J. Comb. Theory Ser. B 2018, 129, 38–54]. In this paper, we prove that every planar graph in which the 5 − -cycles are at distance of at least 3 from each other is DP-3-colorable, which improves the result of Montassier et al. [Inform. Process. Lett. 2008, 107, 3–4] and Yin and Yu [Discret. Math. 2019, 342, 2333–2341]. [ABSTRACT FROM AUTHOR]