On the bend-number of planar and outerplanar graphs

Authors:
Daniel Heldt;Kolja Knauer;Torsten Ueckerdt
Affiliations:
TU Berlin, Berlin, Germany;TU Berlin, Berlin, Germany;Charles University in Prague, Prague, Czech Republic
Venue:
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Year:
2012

Citing 6
Cited 3

Stretching a Knock-Knee Layout for Multilayer Wiring

IEEE Transactions on Computers
On two dual classes of planar graphs

Discrete Mathematics
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
An algorithm for building rectangular floor-plans

DAC '84 Proceedings of the 21st Design Automation Conference
Note: Edge intersection graphs of systems of paths on a grid with a bounded number of bends

Discrete Applied Mathematics
Edge intersection graphs of single bend paths on a grid

Networks

Planar graphs as VPG-Graphs

GD'12 Proceedings of the 20th international conference on Graph Drawing
Approximation algorithms for B 1-EPG graphs

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Edge-intersection graphs of grid paths: The bend-number

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bend-numberb(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.