{
  "id": "1208.0744",
  "version": "v1",
  "published": "2012-08-03T13:51:28.000Z",
  "updated": "2012-08-03T13:51:28.000Z",
  "title": "Drawing outerplanar graphs",
  "authors": [
    "Noga Alon",
    "Ohad Noy Feldheim"
  ],
  "comment": "12 Pages, 5 Figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-08-03T13:51:28.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C10",
      "G.2.2"
    ],
    "keywords": [
      "drawing outerplanar graphs",
      "distinct distances",
      "probabilistic arguments",
      "connected vertices",
      "elementary"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1208.0744A"
    }
  }
}