Name
Abstract | ||
|---|---|---|
DP-coloring (also known as correspondence coloring) is a generalization of list coloring, introduced by Dvořák and Postle in 2017. It is well-known that there are non-4-choosable planar graphs. Much attention has recently been put on sufficient conditions for planar graphs to be DP- 4-colorable. In particular, for each k∈{3,4,5,6}, every planar graph without k-cycles is DP-4-colorable. In this paper, we prove that every planar graph without 7-cycles and butterflies is DP-4-colorable. Our proof can be easily modified to prove other sufficient conditions that forbid clusters formed by many triangles. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.disc.2019.111714 | Discrete Mathematics |
Keywords | DocType | Volume |
Planar graph,Discharging,DP-coloring | Journal | 343 |
Issue | ISSN | Citations |
8 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seog-Jin Kim | 1 | 151 | 17.63 |
| Runrun Liu | 2 | 8 | 5.29 |
| Gexin Yu | 3 | 340 | 40.11 |