# Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard

```@article{Cabello2013AddingOE,
title={Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard},
author={Sergio Cabello and Bojan Mohar},
journal={SIAM J. Comput.},
year={2013},
volume={42},
pages={1803-1829}
}```
• Published 27 March 2012
• Mathematics
• SIAM J. Comput.
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every edge is crossed by at most one other edge. We show that it is NP-hard to decide whether a given near-planar graph is 1-planar. The main idea in both reductions is to consider the problem of simultaneously drawing two planar graphs inside a disk, with some of its…
NIC-planar graphs
• Mathematics
Discret. Appl. Math.
• 2017
Recognizing and drawing IC-planar graphs
• Mathematics
Theor. Comput. Sci.
• 2016
1-Planarity of Graphs with a Rotation System
• Mathematics
J. Graph Algorithms Appl.
• 2015
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.
Drawing Partially Embedded and Simultaneously Planar Graphs
• Mathematics
J. Graph Algorithms Appl.
• 2015
The result on partially embedded graph drawing generalizes a classic result by Pach and Wenger which shows that any planar graph can be drawn with a linear number of bends per edge if the location of each vertex is fixed.
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract)
• Mathematics
Graph Drawing
• 2012
The problem of testing maximal 1-planarity of a graph G can be solved in linear time, if a rotation system (i.e., the circular ordering of edges for each vertex) is given.
A Note on IC-Planar Graphs
• Mathematics
ArXiv
• 2017
It is shown that there are infinitely maximal IC-planar graphs with n vertices and 3n-5 edges and thereby prove a tight lower bound on the density of this class of graphs.
Drawing Partially Embedded and
• Mathematics
• 2015
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem|to extend a straight-line planar drawing of a subgraph to a
Recognizing IC-Planar and NIC-Planar Graphs
It is proved that triangulated IC-planar and NIC-planars graphs can be recognized in cubic time, and planar-maximal and maximal IC- Planar-Maximal and maximum and optimal ones in O(n^3) time.
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
• Mathematics
Graph Drawing
• 2014
A polynomial-time algorithm to test whether a given graph is maximal outer-fan-planar, and it is shown that testing fan-planarity of a graph is NP-hard, for the case where the rotation system i.e., the cyclic order of the edges around each vertex is given.