Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
Published 2011-12-14Version 1
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.
Comments: appears in proceedings of 10th Latin American Symposium on Theoretical Informatics (LATIN 2012)
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
An upper bound for Cubicity in terms of Boxicity
The ratio of the numbers of odd and even cycles in outerplanar graphs
![QR code for arXiv:1112.3353 [math.CO]](http://oss.arxitics.com/images/favicon.svg)