Name
Abstract | ||
|---|---|---|
Wang and Lih (2002) conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results of Lam et al. (1999), Cheng et al. (2016) and Kim and Yu [ arXiv:1709.09809v1]. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.disc.2018.10.025 | Discrete Mathematics |
Keywords | Field | DocType |
DP-coloring,planar graph,discharging | Discrete mathematics,Combinatorics,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
342 | 3 | 0012-365X |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Runrun Liu | 1 | 8 | 5.29 |
| Xiangwen Li | 2 | 111 | 21.01 |