{
  "id": "1910.10312",
  "version": "v1",
  "published": "2019-10-23T01:34:48.000Z",
  "updated": "2019-10-23T01:34:48.000Z",
  "title": "DP-coloring for planar graphs of diameter two",
  "authors": [
    "Jingran Qi",
    "Danjun Huang",
    "Weifan Wang",
    "Stephen Finbow"
  ],
  "categories": [
    "math.CO"
  ],
  "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 $4$-choosable. In this paper, we will prove that planar graphs with diameter at most two are DP-$4$-colorable, which is an extension of the above result.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-10-23T01:34:48.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "planar graphs",
      "dp-coloring",
      "correspondence"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}