{
  "id": "1812.10473",
  "version": "v1",
  "published": "2018-12-24T06:43:50.000Z",
  "updated": "2018-12-24T06:43:50.000Z",
  "title": "Planar graphs without pairwise adjacent 3-,4-,5-, and 6-cycle are 4-choosable",
  "authors": [
    "Pongpat Sittitrai",
    "Kittikorn Nakprasit"
  ],
  "comment": "17 pages and 2 figures",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "Xu and Wu proved that if every 5-cycle of a planar graph G is not simultaneously adjacent to 3-cycles and 4-cycles, then G is 4-choosable. In this paper, we improve this result as follows. If G is a planar graph without pairwise adjacent 3-,4-,5-, and 6-cycle, then G is 4-choosable.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-12-24T06:43:50.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "planar graph",
      "pairwise adjacent",
      "simultaneously adjacent"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 17,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}