# On bounds on bend number of split and cocomparability graphs

A path is a simple, piecewise linear curve made up of alternating horizontal and vertical line segments in the plane. A k-bend path is a path made up of at most k + 1 line segments. A B_k-VPG representation of a graph is a collection of k-bend paths such that each path in the collection represents a vertex of the graph and two such paths intersect if and only if the vertices they represent are adjacent in the graph. The graphs that have a B_k-VPG representation are called B_k-VPG graphs. It is known that the poset dimension dim(G) of a cocomparability graph G is greater than or equal to its bend number bend(G). Cohen et al. (order 2015) asked for examples of cocomparability graphs with low bend number and high poset dimension. We answer this question by proving that for each m, t ∈N, there exists a cocomparability graph G_t,m with t < bend(G_t,m) ≤ 4t+29 and dim(G_t,m)-bend(G_t,m)>m. Techniques used to prove the above result, allows us to partially address the open question posed by Chaplick et al. (wg 2012) who asked whether B_k-VPG-chordal ⊊ B_k+1-VPG-chordal for all k ∈N. We address this by proving that there are infinitely many m ∈N such that B_m-VPG-split ⊊ B_m+1-VPG-split which provides infinitely many positive examples. We use the same techniques to prove that, for all t ∈N, B_t-VPG-Forb(C_≥ 5) ⊊ B_4t+29-VPG-Forb(C_≥ 5), where Forb(C_≥ 5) denotes the family of graphs that does not contain induced cycles of length greater than 4. Furthermore, we show that for all t ∈N, PB_t-VPG-split ⊊ PB_36t+80-VPG-split, where PB_t-VPG denotes the class of graphs with proper bend number at most t.

## Authors

• 7 publications
• 13 publications
• 6 publications
• 2 publications
• ### On bounds on bend number of classes of split and cocomparability graphs

A k-bend path is a rectilinear curve made up of k + 1 line segments. A B...
04/18/2018 ∙ by Dibyayan Chakraborty, et al. ∙ 0

• ### Approximating Minimum Dominating Set on String Graphs

In this paper, we give approximation algorithms for the Minimum Dominati...
09/26/2018 ∙ by Dibyayan Chakraborty, et al. ∙ 0

• ### On the chromatic number of a family of odd hole free graphs

A hole is an induced cycle of length at least 4, and an odd hole is a ho...
10/25/2021 ∙ by Jialei Song, et al. ∙ 0

• ### Characterising circular-arc contact B_0-VPG graphs

A contact B_0-VPG graph is a graph for which there exists a collection o...
09/13/2019 ∙ by Flavia Bonomo-Braberman, et al. ∙ 0

• ### Stick graphs: examples and counter-examples

Stick graphs are the intersection graphs of vertical and horizontal segm...
07/21/2020 ∙ by Irena Rusu, et al. ∙ 0

• ### A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs

We present a quasi linear-time algorithm for Maximum Matching on distanc...
04/25/2018 ∙ by Guillaume Ducoffe, et al. ∙ 0