Restricted String Representations

Abstract

A string representation of a graph assigns to every vertex a curve in the plane so that two curves intersect if and only if the represented vertices are adjacent. This work investigates string representations of graphs with an emphasis on the shapes of curves and the way they intersect. We strengthen some previously known results and show that every planar graph has string representations where every curve consists of axis-parallel line segments with at most two bends (those are the so-called $B_2$-VPG representations) and simultaneously two curves intersect each other at most once (those are the so-called 1-string representations). Thus, planar graphs are $B_2$-VPG $1$-string graphs. We further show that with some restrictions on the shapes of the curves, string representations can be used to produce approximation algorithms for several hard problems. The $B_2$-VPG representations of planar graphs satisfy these restrictions. We attempt to further restrict the number of bends in VPG representations for subclasses of planar graphs, and investigate $B_1$-VPG representations. We propose new classes of string representations for planar graphs that we call ``order-preserving.'' Order-preservation is an interesting property which relates the string representation to the planar embedding of the graph, and we believe that it might prove useful when constructing string representations. Finally, we extend our investigation of string representations to string representations that require some curves to intersect multiple times. We show that there are outer-string graphs that require an exponential number of crossings in their outer-string representations. Our construction also proves that 1-planar graphs, i.e., graphs that are no longer planar, yet fairly close to planar graphs, may have string representations, but they are not always 1-string