Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu·2018-02-26·via math.CO updates on arXiv.org
In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability.