Order-Preserving 1-String Representations of Planar Graphs

This paper considers 1-string representations of planar graphs that are order-preserving in the sense that the order of crossings along the curve representing vertex v is the same as the order of edges in the clockwise order around v in the planar embedding. We show that this does not exist for all planar graphs (not even for all planar 3-trees), but show existence for some subclasses of planar partial 3-trees. In particular, for outer-planar graphs it can be order-preserving and outer-string in the sense that all ends of strings are on the outside of the representation.

[1]  M. Middendorf,et al.  The max clique problem in classes of string-graphs , 1992, Discret. Math..

[2]  Stefan Felsner,et al.  Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations , 2013, Algorithmica.

[3]  Steven Chaplick,et al.  Planar Graphs as VPG-Graphs , 2012, Graph Drawing.

[4]  Therese C. Biedl,et al.  1-string B2-VPG representation of planar graphs , 2016, J. Comput. Geom..

[5]  Joseph S. B. Mitchell,et al.  A Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs ∗ , 2013 .

[6]  Sergio Cabello,et al.  Refining the Hierarchies of Classes of Geometric Intersection Graphs , 2016, Electron. Notes Discret. Math..

[7]  Marcus Schaefer,et al.  Recognizing string graphs in NP , 2003, J. Comput. Syst. Sci..

[8]  J. Kratochvil,et al.  Intersection Graphs of Segments , 1994, J. Comb. Theory, Ser. B.

[9]  J. Pach,et al.  Representation of planar graphs by segments , 1994 .

[10]  Frank Pfeiffer,et al.  Weakly transitive orientations, Hasse diagrams and string graphs , 1993, Discret. Math..

[11]  Therese C. Biedl,et al.  1-string B1-VPG-representations of planar partial 3-trees and some subclasses , 2015, CCCG.

[12]  Jérémie Chalopin,et al.  Every planar graph is the intersection graph of segments in the plane: extended abstract , 2009, STOC '09.

[13]  Stefan Felsner,et al.  Intersection Graphs of L-Shapes and Segments in the Plane , 2014, MFCS.

[14]  Jérémie Chalopin,et al.  Planar Graphs Have 1-string Representations , 2010, Discret. Comput. Geom..

[15]  Abhiruk Lahiri,et al.  VPG and EPG bend-numbers of Halin graphs , 2016, Discret. Appl. Math..

[16]  Jan Kratochvíl,et al.  String graphs. II. recognizing string graphs is NP-hard , 1991, J. Comb. Theory, Ser. B.

[17]  Michael A. Langston,et al.  Approximation the Pathwidth of Outerplanar Graphs , 1998, Inf. Process. Lett..

[18]  Stephen G. Kobourov,et al.  Combinatorial and Geometric Properties of Planar Laman Graphs , 2012, SODA.

[19]  Mark A. Buckingham,et al.  Circle Graphs , 2015 .

[20]  Therese C. Biedl,et al.  $1$-String $B_2$-VPG Representation of Planar Graphs , 2015, Symposium on Computational Geometry.

[21]  Stephen G. Kobourov,et al.  Equilateral L-Contact Graphs , 2013, WG.