{
  "id": "0905.1053",
  "version": "v1",
  "published": "2009-05-07T18:23:04.000Z",
  "updated": "2009-05-07T18:23:04.000Z",
  "title": "A synthesis for exactly 3-edge-connected graphs",
  "authors": [
    "Carl Kingsford",
    "Guillaume Marçais"
  ],
  "comment": "15 pages, 4 figures Submitted to FOCS 2009",
  "categories": [
    "math.CO"
  ],
  "abstract": "A multigraph is exactly k-edge-connected if there are exactly k edge-disjoint paths between any pair of vertices. We characterize the class of exactly 3-edge-connected graphs, giving a synthesis involving two operations by which every exactly 3-edge-connected multigraph can be generated. Slightly modified syntheses give the planar exactly 3-edge-connected graphs and the exactly 3-edge-connected graphs with the fewest possible edges.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-05-07T18:23:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C40"
    ],
    "keywords": [
      "multigraph",
      "edge-disjoint paths",
      "operations",
      "slightly modified syntheses"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0905.1053K"
    }
  }
}