Name
Abstract | ||
|---|---|---|
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle (2017). Kim and Ozeki proved that planar graphs without k-cycles where k=3,4,5, or 6 are DP-4-colorable. In this paper, we prove that every planar graph G without k-cycles adjacent to triangles is DP-4-colorable for k=5,6, which implies that every planar graph G without k-cycles adjacent to triangles is 4-choosable for k=5,6. This extends the result of Kim and Ozeki on 3-, 5-, and 6-cycles. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.dam.2019.09.012 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
DP-colorings,List colorings,Planar graphs,Cycles | Journal | 277 |
Issue | ISSN | Citations |
C | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Runrun Liu | 1 | 8 | 5.29 |
| Xiangwen Li | 2 | 1 | 1.06 |
| Kittikorn Nakprasit | 3 | 74 | 12.32 |
| Pongpat Sittitrai | 4 | 0 | 2.03 |
| Gexin Yu | 5 | 340 | 40.11 |