Planar Graphs with the Distance of 6 - -Cycles at Least 2 from Each Other Are DP-3-Colorable.

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]