Edge Partitions and Visibility Representations of 1-planar Graphs

[1]  Emilio Di Giacomo,et al.  Ortho-polygon Visibility Representations of Embedded Graphs , 2016, Algorithmica.

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

[3]  Stephen K. Wismath,et al.  Characterizing bar line-of-sight graphs , 1985, SCG '85.

[4]  Bogdan Oporowski,et al.  Surfaces, Tree-Width, Clique-Minors, and Partitions , 2000, J. Comb. Theory, Ser. B.

[5]  Zhi-Zhong Chen,et al.  A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs , 2004, Algorithmica.

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

[7]  G. Chartrand,et al.  Graphs with Forbidden Subgraphs , 1971 .

[8]  Michael A. Bekos,et al.  The Book Thickness of 1-Planar Graphs is Constant , 2015, Algorithmica.

[9]  Xin Zhang,et al.  The structure of plane graphs with independent crossings and its applications to coloring problems , 2013 .

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

[11]  Stephen G. Hartke,et al.  Further Results on Bar k-Visibility Graphs , 2007, SIAM J. Discret. Math..

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

[13]  K. Wagner,et al.  Bemerkungen zu einem Sechsfarbenproblem von G. Ringel , 1983 .

[14]  Eyal Ackerman.  A note on 1-planar graphs , 2014, Discret. Appl. Math..

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

[16]  Hazel Everett,et al.  A Visibility Representation for Graphs in Three Dimensions , 1998, J. Graph Algorithms Appl..

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

[18]  Christian Bachmaier,et al.  NIC-planar graphs , 2017, Discret. Appl. Math..

[19]  D. Král,et al.  Coloring plane graphs with independent crossings , 2010 .

[20]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

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

[22]  Chris P. Carter.  Hyper-realism in the Adventures of Tintin , 2019, International Journal of Computer Graphics & Animation.

[23]  Giuseppe Liotta,et al.  L-Visibility Drawings of IC-Planar Graphs , 2015, Graph Drawing.

[24]  Giuseppe Liotta,et al.  Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs , 2018, GD.

[25]  David Eppstein,et al.  Structure of Graphs with Locally Restricted Crossings , 2015, SIAM J. Discret. Math..

[26]  Kiran S. Kedlaya.  Outerplanar Partitions of Planar Graphs , 1996, J. Comb. Theory, Ser. B.

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

[28]  Dmitri Karpov.  An Upper Bound on the Number of Edges in an Almost Planar Bipartite Graph , 2014 .

[29]  Giuseppe Liotta,et al.  Simultaneous visibility representations of plane st-graphs using L-shapes , 2016, Theor. Comput. Sci..

[30]  Franz-Josef Brandenburg,et al.  Recognizing Optimal 1-Planar Graphs in Linear Time , 2016, Algorithmica.

[31]  Stephen G. Kobourov,et al.  On the Book Thickness of 1-Planar Graphs , 2015, ArXiv.

[32]  Július Czap,et al.  Drawing Graph Joins in the Plane with Restrictions on Crossings , 2017 .

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

[34]  Giuseppe Liotta,et al.  Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs , 2018, Discret. Comput. Geom..

[35]  Sándor P. Fekete,et al.  Rectangle and Box Visibility Graphs in 3D , 1999, Int. J. Comput. Geom. Appl..

[36]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[37]  Jan Stola.  Unimaximal Sequences of Pairs in Rectangle Visibility Drawing , 2008, Graph Drawing.

[38]  Daniel Král,et al.  Coloring plane graphs with independent crossings , 2010, J. Graph Theory.

[39]  Pat Morin,et al.  Planar Graphs have Bounded Queue-Number , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[40]  Michael A. Bekos,et al.  Edge partitions of optimal 2-plane and 3-plane graphs , 2019, Discret. Math..

[41]  Sándor P. Fekete,et al.  New Results on a Visibility Representation of Graphs in 3D , 1995, GD.

[42]  Michael A. Bekos,et al.  Planar Graphs of Bounded Degree Have Bounded Queue Number , 2019, SIAM J. Comput..

[43]  Walter Didimo,et al.  An Experimental Study of a 1-planarity Testing and Embedding Algorithm , 2020, WALCOM.

[44]  Yahya Ould Hamidoune,et al.  Representing a planar graph by vertical lines joining different levels , 1983, Discret. Math..

[45]  Michael Kaufmann,et al.  Bar 1-Visibility Graphs vs. other Nearly Planar Graphs , 2014, J. Graph Algorithms Appl..

[46]  Giuseppe Liotta,et al.  On Visibility Representations of Non-planar Graphs , 2015 .

[47]  Daniel Gonçalves,et al.  Edge partition of planar sraphs into two outerplanar graphs , 2005, STOC '05.

[48]  Ellen Gethner,et al.  Bar k-Visibility Graphs , 2007, J. Graph Algorithms Appl..

[49]  Július Czap,et al.  On Drawings and Decompositions of 1-Planar Graphs , 2013, Electron. J. Comb..

[50]  Emilio Di Giacomo,et al.  New results on edge partitions of 1-plane graphs , 2018, Theor. Comput. Sci..

[51]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

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

[53]  Walter Didimo,et al.  Recognizing and drawing IC-planar graphs , 2015, Theor. Comput. Sci..

[54]  Michael A. Bekos,et al.  On 3D visibility representations of graphs with few crossings per edge , 2019, Theor. Comput. Sci..

[55]  Thomas C. Shermer,et al.  On Rectangle Visibility Graphs. III. External Visibility and Complexity , 1996, CCCG.

[56]  Franz-Josef Brandenburg.  1-Visibility Representations of 1-Planar Graphs , 2014, J. Graph Algorithms Appl..

[57]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[58]  Weidong Huang,et al.  Larger crossing angles make graphs easier to read , 2014, J. Vis. Lang. Comput..

[59]  Giuseppe Liotta,et al.  On partitioning the edges of 1-plane graphs , 2015, Theor. Comput. Sci..

[60]  Jaroslav Nesetril,et al.  Characterisations and examples of graph classes with bounded expansion , 2009, Eur. J. Comb..