{
  "id": "1101.2357",
  "version": "v1",
  "published": "2011-01-12T13:44:25.000Z",
  "updated": "2011-01-12T13:44:25.000Z",
  "title": "Minimal Connectivity",
  "authors": [
    "Matthias Kriesell"
  ],
  "comment": "IMADA-preprint-math, 33 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a prominent role in graph connectivity theory, and we give a brief introduction with a light emphasis on reduction- and construction theorems for classes of k-connected graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-01-12T13:44:25.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "minimal connectivity",
      "k-connected graph",
      "graph connectivity theory",
      "construction theorems",
      "edge results"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 33,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}