Re-embedding a 1-plane graph for a straight-line drawing in linear time

[1]  Walter Didimo,et al.  Drawing graphs with right angle crossings , 2009, Theor. Comput. Sci..

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

[3]  Giuseppe Liotta,et al.  An annotated bibliography on 1-planarity , 2017, Comput. Sci. Rev..

[4]  Giuseppe Liotta,et al.  A Linear-Time Algorithm for Testing Outer-1-Planarity , 2013, Algorithmica.

[5]  Takao Nishizeki,et al.  Journal of Graph Algorithms and Applications a Linear Algorithm for Bend-optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs , 2022 .

[7]  André Raspaud,et al.  Acyclic colouring of 1-planar graphs , 2001, Discret. Appl. Math..

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

[9]  Carsten Thomassen,et al.  Rectilinear drawings of graphs , 1988, J. Graph Theory.

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

[11]  V. Bryant,et al.  Straight line representations of planar graphs. , 1989 .

[12]  Hiroshi Nagamochi,et al.  Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time , 2016, GD.

[13]  Sang Won Bae,et al.  Gap-planar graphs , 2018, Theor. Comput. Sci..

[14]  Roberto Tamassia,et al.  On-Line Planarity Testing , 1989, SIAM J. Comput..

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

[16]  G. Ringel.  Ein Sechsfarbenproblem auf der Kugel , 1965 .

[17]  Walter Didimo,et al.  A Survey on Graph Drawing Beyond Planarity , 2018, ACM Comput. Surv..

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

[19]  Csaba D. Tóth,et al.  Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092) , 2019, Dagstuhl Reports.

[20]  Giuseppe Liotta,et al.  A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system , 2013, Theor. Comput. Sci..

[21]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[22]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[23]  David Eppstein,et al.  Parameterized Complexity of 1-Planarity , 2013, WADS.

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

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

[26]  Tomás Madaras,et al.  The structure of 1-planar graphs , 2007, Discret. Math..

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

[28]  Michael A. Bekos,et al.  Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs , 2018, ISAAC.

[29]  Ignaz Rutter,et al.  Beyond level planarity: Cyclic, torus, and simultaneous level planarity , 2020, Theor. Comput. Sci..

[30]  Seok-Hee Hong.  Algorithms for 1-Planar Graphs , 2020, Beyond Planar Graphs.

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

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