On the bend-number of planar and outerplanar graphs

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01457986
Contributor : Kolja Knauer <>
Submitted on : Monday, February 6, 2017 - 4:13:13 PM
Last modification on : Saturday, August 24, 2019 - 1:17:00 AM
Long-term archiving on : Sunday, May 7, 2017 - 2:42:44 PM

File

arxiv-bends.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01457986, version 1

Collections

Citation

Daniel Heldt, Kolja Knauer, Torsten Ueckerdt. On the bend-number of planar and outerplanar graphs. Discrete Applied Mathematics, Elsevier, 2014. ⟨hal-01457986⟩

Share

Metrics

Record views

149

Files downloads

116