{
  "id": "0810.0508",
  "version": "v2",
  "published": "2008-10-02T18:14:52.000Z",
  "updated": "2008-11-04T09:26:47.000Z",
  "title": "Drawing disconnected graphs on the Klein bottle",
  "authors": [
    "Laurent Beaudou",
    "Antoine Gerbaud",
    "Roland Grappe",
    "Frederic Palesi"
  ],
  "comment": "13 pages, second version, major changes in the proof",
  "categories": [
    "math.CO"
  ],
  "abstract": "We prove that two disjoint graphs must always be drawn separately on the Klein bottle, in order to minimize the crossing number of the whole drawing.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2008-11-04T09:26:47.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10"
    ],
    "keywords": [
      "klein bottle",
      "drawing disconnected graphs",
      "disjoint graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0810.0508B"
    }
  }
}