Edge-intersection graphs of grid paths: the bend-number

Details Edge-intersection graphs of grid paths: the bend-number Edge-intersection graphs of grid paths: the bend-number

2010-09-15

arxiv.org/abs/1009.2861v1

Mathematics

Combinatorics

25 pages, 27 figures

Scientific paper

We investigate edge-intersection graphs of paths in the plane grid regarding a parameter called the bend-number. The bend-number is related to the interval-number and the track-number of a graph. We provide new upper and lower bounds of the bend-number of any given simple graph in terms of the coloring number, edge clique covers and the maximum degree. We show that the bend-number of an outerplanar graph is at most two and that several subclasses of planar graphs have a bend-number of at most three or four. Moreover we determine the bend-numbers of several complete bipartite graphs. Finally, we prove that recognizing single-bend graphs is NP-complete, providing the first such result in this field.

Affiliated with

Also associated with

No associations

Rating

Edge-intersection graphs of grid paths: the bend-number 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 Edge-intersection graphs of grid paths: the bend-number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge-intersection graphs of grid paths: the bend-number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77022