{
  "id": "math/0609219",
  "version": "v1",
  "published": "2006-09-07T20:11:11.000Z",
  "updated": "2006-09-07T20:11:11.000Z",
  "title": "On the Cycle Space of a 3--Connected Graph",
  "authors": [
    "Alexander Kelmans"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We give a simple proof of Tutte's theorem stating that the cycle space of a 3--connected graph is generated by the set of non-separating circuits of the graph. Keywords: graph, cycle, circuit, cycle space, non-separating circuit, strong isomorphism.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-09-07T20:11:11.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10"
    ],
    "keywords": [
      "cycle space",
      "non-separating circuit",
      "simple proof",
      "strong isomorphism"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math......9219K"
    }
  }
}