Fan-planarity: Properties and complexity

In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt 35], who proved that every n-vertex fan-planar drawing has at most 5 n - 10 edges, and that this bound is tight for n ? 20 . We extend their result from both the combinatorial and the algorithmic point of view. We prove tight bounds on the density of constrained versions of fan-planar drawings and study the relationship between fan-planarity and k-planarity. Also, we prove that testing fan-planarity in the variable embedding setting is NP-complete.

[1]  K. Wagner,et al.  Über 1-optimale Graphen , 1984 .

[2]  David Eppstein,et al.  On the Density of Maximal 1-Planar Graphs , 2012, Graph Drawing.

[3]  János Pach,et al.  Graphs drawn with few crossings per edge , 1997, Comb..

[4]  Walter Didimo,et al.  Drawing Graphs with Right Angle Crossings , 2009, WADS.

[5]  Emilio Di Giacomo,et al.  h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area , 2012, WG.

[6]  David Eppstein,et al.  Confluent Layered Drawings , 2006, Algorithmica.

[7]  Giuseppe Liotta,et al.  Right angle crossing graphs and 1-planarity , 2013, Discret. Appl. Math..

[8]  Stephen G. Kobourov,et al.  Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs , 2013, Graph Drawing.

[9]  Otfried Cheong,et al.  On the Number of Edges of Fan-Crossing Free Graphs , 2013, ISAAC.

[10]  Emilio Di Giacomo,et al.  Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings , 2010, Theory of Computing Systems.

[11]  Vladimir P. Korzhik,et al.  Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing , 2013, J. Graph Theory.

[12]  Alexander Grigoriev,et al.  Algorithms for Graphs Embeddable with Few Crossings per Edge , 2005, Algorithmica.

[13]  Michael A. Bekos,et al.  On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs , 2014, Algorithmica.

[14]  Micha Sharir,et al.  Quasi-planar graphs have a linear number of edges , 1995, GD.

[15]  Joachim Gudmundsson,et al.  Notes on Large Angle Crossing Graphs , 2009, Chic. J. Theor. Comput. Sci..

[16]  Michael Kaufmann,et al.  The Density of Fan-Planar Graphs , 2014, Electron. J. Comb..

[17]  Kouhei Asano,et al.  The crossing number of K1, 3, n and K2, 3, n , 1986, J. Graph Theory.

[18]  Lowell W. Beineke,et al.  The crossing number of C3 × Cn , 1978, J. Comb. Theory, Ser. B.

[19]  Yusuke Suzuki.  Re-embeddings of Maximum 1-Planar Graphs , 2010, SIAM J. Discret. Math..

[20]  Ioannis G. Tollis,et al.  Fan-Planar Graphs: Combinatorial Properties and Complexity Results , 2014, Graph Drawing.

[21]  Pavel Valtr,et al.  On Geometric Graphs with No k Pairwise Parallel Edges , 1997, Discret. Comput. Geom..

[22]  Franz-Josef Brandenburg,et al.  On Sparse Maximal 2-Planar Graphs , 2012, Graph Drawing.

[23]  Giuseppe Liotta,et al.  A Linear-Time Algorithm for Testing Outer-1-Planarity , 2013, Graph Drawing.

[24]  David Eppstein,et al.  Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way , 2022 .

[25]  Emilio Di Giacomo,et al.  2-Layer Right Angle Crossing Drawings , 2011, Algorithmica.

[26]  M. Schaefer.  The Graph Crossing Number and its Variants: A Survey , 2013 .

[27]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[28]  Peter Eades,et al.  Every outer-1-Plane Graph has a Right Angle Crossing Drawing , 2012, Int. J. Comput. Geom. Appl..

[29]  Július Czap,et al.  1-planarity of Complete Multipartite Graphs , 2012, Discret. Appl. Math..

[30]  Yusuke Suzuki,et al.  Optimal 1-planar graphs which triangulate other surfaces , 2010, Discret. Math..

[31]  János Pach,et al.  The Number of Edges in k-Quasi-planar Graphs , 2011, SIAM J. Discret. Math..

[32]  Eyal Ackerman.  On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges , 2009, Discret. Comput. Geom..

[33]  Michael Kaufmann,et al.  Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area , 2011, EGC.

[34]  Emilio Di Giacomo,et al.  Area requirement of graph drawings with few crossings per edge , 2013, Comput. Geom..

[35]  Csaba D. Tóth,et al.  Graphs That Admit Polyline Drawings with Few Crossing Angles , 2012, SIAM J. Discret. Math..

[36]  Christian Bachmaier,et al.  Recognizing Outer 1-Planar Graphs in Linear Time , 2013, GD.

[37]  Walter Didimo,et al.  The Crossing-Angle Resolution in Graph Drawing , 2013 .

[38]  Ioannis G. Tollis,et al.  Fan-planarity: Properties and complexity , 2014, Theor. Comput. Sci..

[39]  Giuseppe Liotta,et al.  Fáry's Theorem for 1-Planar Graphs , 2012, COCOON.

[40]  Gábor Tardos,et al.  On the maximum number of edges in quasi-planar graphs , 2007, J. Comb. Theory, Ser. A.

[41]  Walter Didimo.  Density of straight-line 1-planar graph drawings , 2013, Inf. Process. Lett..