Name
Abstract | ||
|---|---|---|
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced by Dvořák and Postle in 2017. In this paper, we prove that every planar graph without 4-cycles adjacent to k-cycles is DP-4-colorable for k=5 and 6. As a consequence, we obtain two new classes of 4-choosable planar graphs. We use identification of vertices in the proof, and actually prove stronger statements that every pre-coloring of some short cycles can be extended to the whole graph. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.disc.2019.05.032 | Discrete Mathematics |
Keywords | Field | DocType |
DP-coloring,Identify,Separating cycles | Graph,Discrete mathematics,Combinatorics,List coloring,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
342 | 11 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lily Chen | 1 | 0 | 0.68 |
| Runrun Liu | 2 | 8 | 5.29 |
| Gexin Yu | 3 | 340 | 40.11 |
| Ren Zhao | 4 | 48 | 15.88 |
| Xiangqian Zhou | 5 | 56 | 13.29 |