{
  "id": "1509.01013",
  "version": "v1",
  "published": "2015-09-03T09:57:18.000Z",
  "updated": "2015-09-03T09:57:18.000Z",
  "title": "Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations",
  "authors": [
    "Zdenek Dvorak",
    "Daniel Kral",
    "Robin Thomas"
  ],
  "comment": "28 pages, no figures",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-09-03T09:57:18.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C85",
      "05C15",
      "F.2.2",
      "G.2.2"
    ],
    "keywords": [
      "three-coloring triangle-free graphs",
      "surfaces vi",
      "quadrangulations",
      "linear-time algorithm"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 28,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150901013D"
    }
  }
}