{
  "id": "1305.2467",
  "version": "v1",
  "published": "2013-05-11T02:49:35.000Z",
  "updated": "2013-05-11T02:49:35.000Z",
  "title": "3-coloring triangle-free planar graphs with a precolored 8-cycle",
  "authors": [
    "Zdeněk Dvořák",
    "Bernard Lidický"
  ],
  "comment": "20 pages, 5 figures",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of the whole graph.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-05-11T02:49:35.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C10",
      "G.2.2"
    ],
    "keywords": [
      "triangle-free planar graphs",
      "planar triangle-free graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 20,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1305.2467D"
    }
  }
}