{
  "id": "1907.13104",
  "version": "v1",
  "published": "2019-07-28T18:50:09.000Z",
  "updated": "2019-07-28T18:50:09.000Z",
  "title": "Drawing outerplanar graphs using finitely many edge lengths",
  "authors": [
    "Ziv Bakhajian",
    "Ohad N. Feldheim"
  ],
  "comment": "21 pages, 5 figures. arXiv admin note: substantial text overlap with arXiv:1208.0744",
  "categories": [
    "math.CO"
  ],
  "abstract": "It is shown that every outerplanar graph $G$ could be linearly embedded in the plane so that the number of distinct distances between pairs of adjacent vertices is at most thirteen and there is no intersection between the image of a vertex and that of an edge not containing it. This settles a problem of Carmi, Dujmovi\\'{c}, Morin and Wood.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-07-28T18:50:09.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10",
      "G.2.2"
    ],
    "keywords": [
      "drawing outerplanar graphs",
      "edge lengths",
      "distinct distances",
      "adjacent vertices",
      "intersection"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 21,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}