{
  "id": "1801.06760",
  "version": "v1",
  "published": "2018-01-21T03:46:01.000Z",
  "updated": "2018-01-21T03:46:01.000Z",
  "title": "Planar graphs without triangles adjacent to $6$-cycles are DP-$4$-colorable",
  "authors": [
    "Pongpat Sittitrai",
    "Kittikorn Nakprasit"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "DP-coloring is a generalization of a list coloring in a simple graph. Kim and Ozeki showed that planar graphs without $k$-cycles where $k=3,4,5,$ or $6$ are DP-$4$-colorable. In this paper, we extend the result on $3$- and $6$-cycles by showing that planar graphs without triangles adjacent to $6$-cycles are DP-$4$-colorable.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-01-21T03:46:01.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "planar graphs",
      "triangles adjacent",
      "simple graph",
      "generalization"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}