Interval representations of planar graphs
Journal of Combinatorial Theory Series B
Discrete Mathematics
On finding the rectangular duals of planar triangular graphs
SIAM Journal on Computing
Intersection graphs of segments
Journal of Combinatorial Theory Series B
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Every planar graph is the intersection graph of segments in the plane: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
Proportional contact representations of planar graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
On the bend-number of planar and outerplanar graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.00 |
A graph is Bk-VPG when it has an intersection representation by paths in a rectangular grid with at most k bends (turns). It is known that all planar graphs are B3-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are B2-VPG. We also show that the 4-connected planar graphs are a subclass of the intersection graphs of Z-shapes (i.e., a special case of B2-VPG). Additionally, we demonstrate that a B2-VPG representation of a planar graph can be constructed in O(n3/2) time. We further show that the triangle-free planar graphs are contact graphs of: L-shapes, Γ-shapes, vertical segments, and horizontal segments (i.e., a special case of contact B1-VPG). From this proof we gain a new proof that bipartite planar graphs are a subclass of 2-DIR.