Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.disc.2018.09.025 | Discrete Mathematics |
Keywords | Field | DocType |
List coloring,DP-coloring,Planar graphs | Discrete mathematics,Combinatorics,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
342 | 1 | 0012-365X |
Citations | PageRank | References |
1 | 0.36 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Runrun Liu | 1 | 8 | 5.29 |
| Sarah Loeb | 2 | 4 | 2.52 |
| Yuxue Yin | 3 | 1 | 0.70 |
| Gexin Yu | 4 | 340 | 40.11 |