{
  "id": "1901.09955",
  "version": "v1",
  "published": "2019-01-28T19:33:14.000Z",
  "updated": "2019-01-28T19:33:14.000Z",
  "title": "Graphs with at most one crossing",
  "authors": [
    "André C. Silva",
    "Alan Arroyo",
    "R. Bruce Richter",
    "Orlando Lee"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The crossing number of a graph $G$ is the least number of crossings over all possible drawings of $G$. We present a structural characterization of graphs with crossing number one.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-01-28T19:33:14.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "crossing number",
      "structural characterization"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}