DP-3-coloring of some planar graphs
arXiv:1802.09312
Abstract
In this article, we use a unified approach to prove several classes of planar graphs are DP--colorable, which extend the corresponding results on -choosability.
15 pages, five figures. We revised the previous version based on referees' report