| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 11592564 | Discrete Mathematics | 2019 | 12 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu,