On the bend-number of planar and outerplanar graphs

Details On the bend-number of planar and outerplanar graphs On the bend-number of planar and outerplanar graphs

2011-12-14

arxiv.org/abs/1112.3353v1

Mathematics

Combinatorics

appears in proceedings of 10th Latin American Symposium on Theoretical Informatics (LATIN 2012)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the bend-number of planar and outerplanar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the bend-number of planar and outerplanar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the bend-number of planar and outerplanar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561302