{
  "id": "0811.2704",
  "version": "v1",
  "published": "2008-11-17T13:34:19.000Z",
  "updated": "2008-11-17T13:34:19.000Z",
  "title": "Cyclic colorings of plane graphs with independent faces",
  "authors": [
    "Jernej Azarija",
    "Daniel Král'",
    "Rok Erman",
    "Matjaz Krnc",
    "Ladislav Stacho"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Let G be a plane graph with maximum face size D. If all faces of G with size four or more are vertex disjoint, then G has a cyclic coloring with D+1 colors, i.e., a coloring such that all vertices incident with the same face receive distinct colors.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-11-17T13:34:19.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C10"
    ],
    "keywords": [
      "plane graph",
      "independent faces",
      "cyclic coloring",
      "face receive distinct colors",
      "vertex disjoint"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0811.2704A"
    }
  }
}