2012 | OriginalPaper | Buchkapitel
On the Bend-Number of Planar and Outerplanar Graphs
verfasst von : Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
Erschienen in: LATIN 2012: Theoretical Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.