Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
| Autor: | Liu, Runrun, Li, Xiangwen |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | Wang and Lih in 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, Xu and Liu [Journal of Combin. Theory, Ser. B, 76 (1999) 117--126], of Cheng, Chen and Wang [Discrete Math., 339(2016) 3052--3057] and of Kim and Yu [arXiv:1709.09809v1]. Comment: 8pages,0figures. arXiv admin note: text overlap with arXiv:1804.03976 |
| Databáze: | arXiv |
| Externí odkaz: |
|