{
  "id": "1405.5117",
  "version": "v1",
  "published": "2014-05-20T15:18:54.000Z",
  "updated": "2014-05-20T15:18:54.000Z",
  "title": "Crossing numbers of periodic graphs",
  "authors": [
    "Zdenek Dvorak",
    "Bojan Mohar"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-05-20T15:18:54.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10"
    ],
    "keywords": [
      "periodic graph",
      "limit crossing number",
      "cyclic fashion",
      "benny pinontoan",
      "bruce richter"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1405.5117D"
    }
  }
}