Gap-Planar Graphs

  title={Gap-Planar Graphs},
  author={Sang Won Bae and Jean-François Baffier and Jinhee Chun and Peter Eades and Kord Eickmeyer and Luca Grilli and Seok-Hee Hong and Matias Korman and Fabrizio Montecchiani and Ignaz Rutter and Csaba D. T{\'o}th},
  journal={Theor. Comput. Sci.},

Figures from this paper

On Optimal Beyond-Planar Graphs
The range for optimal graphs is computed, combinatorial properties are established, and it is shown that every graph is a topological minor of an optimal graph.
Crossing Numbers of Beyond-Planar Graphs Revisited
This paper extends the results of Chimani et al. to the main currently known classes of beyond-planar graphs characterized by forbidden edge configurations and answers several of their open questions.
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
Overcoming the limitations of standard combinatorial arguments, this work presents a technique to systematically generate all non-isomorphic topological representations of complete and complete bipartite graphs, taking into account the constraints of the specific class.
Fan-Crossing Free Graphs
The fan22 crossing free graphs are shown to be universal for 2-subdivision and for node-to-circle 3 expansion, and universality for an operation and a graph class is introduced, so the every graph has an image in the graph class.
On RAC Drawings of Graphs with one Bend per Edge
It is shown that an n-vertex 1-bend RAC graph cannot have more than $5.5n-O(1)$ edges, and it is demonstrated that there exist infinitely many n- Vertex1-bends RAC graphs with exactly $5 n-O (1) edges.
Beyond Planar Graphs: Communications of NII Shonan Meetings
This chapter introduces various types of beyond planar graphs and briefly review known results on the edge density, computational complexity, and algorithms for testing beyondPlanar graphs.
Shallow Minors, Graph Products and Beyond Planar Graphs
The planar graph product structure theorem of Dujmović, Joret, Micek, Morin, Ueckerdt, and Wood [J. ACM 2020] states that every planar graph is a subgraph of the strong product of a graph with
On the Edge Crossings of the Greedy Spanner
The results imply that greedy spanners for points in the plane have separators of size $\mathcal{O}(\sqrt n)$, that their planarizations have linear size, and that a separator hierarchy for these graphs can be constructed from theirPlanarizations in linear time.
Edge-Minimum Saturated k-Planar Drawings
A generic framework is established to determine the minimum number of edges among all $n-vertex saturated $k$-planar drawings in many natural classes.


On the Relationship between k-Planar and k-Quasi Planar Graphs
This paper proves that, for \(k \ge 3\), every k-planar graph is \((k+1)\)-quasi- Planar, and several bounds have been proven on their edge density.
On the Size of Planarly Connected Crossing Graphs
We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has
Graphs drawn with few crossings per edge
It is shown that if a graph ofv vertices can be drawn in the plane so that every edge crosses at mostk>0 others, then its number of edges cannot exceed 4.108√kv, and a better bound is established, (k+3)(v−2), which is tight fork=1 and 2.
1-Planarity of Graphs with a Rotation System
It is shown that 1-planarity remains NP-hard even for 3-connected 2-planar graphs with (or without) a rotation system, and the crossing number problem remainsNP-hard for3-connected 1- PLANAR graphs with a given rotation system.
Fan-planarity: Properties and complexity
On the maximum number of edges in quasi-planar graphs
On the Density of Non-simple 3-Planar Graphs
It is proved that the bound of \(\frac{11}{2}n-11\) edges also holds for non-simple 3-planar graphs that admit drawings in which non-homotopic parallel edges and self-loops are allowed.
The Number of Edges in k-Quasi-planar Graphs
It is proved that the maximum number of edges of such graphs is at most $2^{ck^6}n\log n$, extending some ideas of Valtr.
Algorithms for Graphs Embeddable with Few Crossings per Edge
It is proved that many optimization problems, including maximum independent set, minimum vertex cover, minimum dominating set and many others, admit polynomial time approximation schemes when restricted to graphs embedded on a surface of bounded genus such that each edge has a bounded number of crossings.