{
  "id": "1411.6392",
  "version": "v1",
  "published": "2014-11-24T09:37:27.000Z",
  "updated": "2014-11-24T09:37:27.000Z",
  "title": "Generating the cycle space of planar graphs",
  "authors": [
    "Matthias Hamann"
  ],
  "comment": "7 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We prove that the cycle space of every planar finitely separable 3-connected graph $G$ is generated by some ${\\rm Aut}(G)$-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-11-24T09:37:27.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "cycle space",
      "planar graphs",
      "invariant nested set",
      "smaller connectivity"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1411.6392H"
    }
  }
}