{
  "id": "1507.06800",
  "version": "v1",
  "published": "2015-07-24T10:25:44.000Z",
  "updated": "2015-07-24T10:25:44.000Z",
  "title": "The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs",
  "authors": [
    "Emily Abernethy Marshall",
    "Liana Yepremyan",
    "Zach Gaslowitz"
  ],
  "comment": "6 pages",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-07-24T10:25:44.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "characterization",
      "free graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150706800A"
    }
  }
}