Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu
Published 2018-02-26Version 1
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.
Comments: 15 pages, five figures
On choosability with separation of planar graphs with lists of different sizes
Choosability of planar graphs of girth 5
Nearly Planar Graphs and λ-flat Graphs
![QR code for arXiv:1802.09312 [math.CO]](http://oss.arxitics.com/images/favicon.svg)