{
  "id": "1112.3353",
  "version": "v1",
  "published": "2011-12-14T21:01:24.000Z",
  "updated": "2011-12-14T21:01:24.000Z",
  "title": "On the bend-number of planar and outerplanar graphs",
  "authors": [
    "Daniel Heldt",
    "Kolja Knauer",
    "Torsten Ueckerdt"
  ],
  "comment": "appears in proceedings of 10th Latin American Symposium on Theoretical Informatics (LATIN 2012)",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of outerplanar graphs is 2. Moreover we improve the formerly known lower and upper bound for the maximum bend-number of planar graphs from 2 and 5 to 3 and 4, respectively.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-12-14T21:01:24.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C62",
      "G.2.1",
      "F.2.2"
    ],
    "keywords": [
      "outerplanar graphs",
      "maximum bend-number",
      "edge intersection graph",
      "upper bound",
      "grid paths"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}