DP-coloring for planar graphs of diameter two
Combinatorics
2019-10-24 v1
Abstract
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced by Dvo\u{r}\'{a}k and Postle (2017). Recently, Huang et al. [https://doi.org/10.1016/j.amc.2019.124562] showed that planar graphs with diameter at most two are -choosable. In this paper, we will prove that planar graphs with diameter at most two are DP--colorable, which is an extension of the above result.
Cite
@article{arxiv.1910.10312,
title = {DP-coloring for planar graphs of diameter two},
author = {Jingran Qi and Danjun Huang and Weifan Wang and Stephen Finbow},
journal= {arXiv preprint arXiv:1910.10312},
year = {2019}
}