Geometric Biplane Graphs II: Graph Augmentation

We study biplane graphs drawn on a finite point set $$S$$S in the plane in general position. This is the family of geometric graphs whose vertex set is $$S$$S and which can be decomposed into two plane graphs. We show that every sufficiently large point set admits a 5-connected biplane graph and that there are arbitrarily large point sets that do not admit any 6-connected biplane graph. Furthermore, we show that every plane graph (other than a wheel or a fan) can be augmented into a 4-connected biplane graph. However, there are arbitrarily large plane graphs that cannot be augmented to a 5-connected biplane graph by adding pairwise noncrossing edges.

[1]  Csaba D. Tóth.  Connectivity augmentation in planar straight line graphs , 2012, Eur. J. Comb..

[2]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[3]  Subhash Suri,et al.  Applications of a semi-dynamic convex hull algorithm , 1990, BIT.

[4]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[5]  Csaba D. Tóth,et al.  Geometric Biplane Graphs I: Maximal Graphs , 2015, Graphs Comb..

[6]  W. T. Tutte.  A THEOREM ON PLANAR GRAPHS , 1956 .

[7]  Brendan D. McKay,et al.  Construction of planar triangulations with minimum degree 5 , 2005, Discret. Math..

[8]  Evangelos Kranakis,et al.  Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs , 2012, Discret. Math. Algorithms Appl..

[9]  Alexander Wolff,et al.  Augmenting the Connectivity of Planar and Geometric Graphs , 2012, J. Graph Algorithms Appl..

[10]  Joseph S. B. Mitchell,et al.  On Simultaneous Planar Graph Embeddings , 2003, WADS.

[11]  Tamal K. Dey,et al.  Triangulating with High Connectivity , 1997, Comput. Geom..

[12]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[13]  R. Pollack,et al.  Embedding a planar triangulation with vertices at specified points , 1991 .

[14]  Pavel Valtr,et al.  On 4-connected geometric graphs , 2013 .

[15]  Saumyendra Sengupta,et al.  Graphs and Digraphs , 1994 .

[16]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.

[17]  Csaba D. Tóth,et al.  Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three , 2011, Algorithmica.

[18]  G. Tóth,et al.  The Erdős – Szekeres Theorem : Upper Bounds and Related Results , 2004 .

[19]  Csaba D. Tóth,et al.  Constrained Tri-Connected Planar Straight Line Graphs , 2013 .

[20]  Csaba D. Tóth,et al.  Plane Geometric Graph Augmentation: A Generic Perspective , 2013 .

[21]  Michael A. Bender,et al.  The LCA Problem Revisited , 2000, LATIN.

[22]  Ajit A. Diwan,et al.  Four-Connected Triangulations of Planar Point Sets , 2015, Discret. Comput. Geom..

[23]  J. W. Butler.  A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs , 1974, Canadian Journal of Mathematics.

[24]  Pavel Valtr,et al.  On triconnected and cubic plane graphs on given point sets , 2009, Comput. Geom..

[25]  Prosenjit Bose,et al.  On Embedding an Outer-Planar Graph in a Point Set , 1997, GD.

[26]  Evangelos Kranakis,et al.  Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs , 2010, COCOA.

[27]  David W. Barnette.  On generating planar graphs , 1974, Discret. Math..

[28]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[29]  Jorge Urrutia,et al.  Augmenting the connectivity of geometric graphs , 2008, Comput. Geom..

[30]  Evangelos Kranakis,et al.  Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points , 2012, LATIN.

[31]  Thomas C. Shermer,et al.  On representations of some thickness-two graphs , 1995, Comput. Geom..