{
  "id": "1506.04629",
  "version": "v1",
  "published": "2015-06-15T15:20:03.000Z",
  "updated": "2015-06-15T15:20:03.000Z",
  "title": "The 3-colorability of planar graphs without cycles of length 4, 6 and 9",
  "authors": [
    "Yingli Kang",
    "Ligang Jin",
    "Yingqian Wang"
  ],
  "comment": "15 pages, 1 figure",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we prove that planar graphs without cycles of length 4, 6, 9 are 3-colorable.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-06-15T15:20:03.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10",
      "05C15"
    ],
    "keywords": [
      "planar graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}