Adding one edge to planar graphs makes crossing number hard

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea in the reduction is to consider the problem of simultaneously drawing two planar graphs inside a disk, with some of its vertices fixed at the boundary of the disk. This approach can be used to prove hardness of some other geometric problems. As an interesting consequence we obtain a new, geometric proof of NP-completeness of the crossing number problem, even when restricted to cubic graphs. This resolves a question of Hlinený.

[1]  Hristo Djidjev,et al.  Planar Crossing Numbers of Genus g Graphs , 2006, ICALP.

[2]  Petra Mutzel,et al.  Inserting an Edge into a Planar Graph , 2001, SODA '01.

[3]  Markus Chimani,et al.  Approximating the crossing number of graphs embeddable in any orientable surface , 2010, SODA '10.

[4]  Bojan Mohar,et al.  Crossing Number and Weighted Crossing Number of Near-Planar Graphs , 2011, Algorithmica.

[5]  János Pach,et al.  Planar Crossing Numbers of Graphs Embeddable in Another Surface , 2006, Int. J. Found. Comput. Sci..

[6]  Bruce A. Reed,et al.  Computing crossing number in linear time , 2007, STOC '07.

[7]  Petr Hlinený,et al.  Crossing Number Is Hard for Cubic Graphs , 2004, MFCS.

[8]  Michael J. Pelsmajer,et al.  Crossing Number of Graphs with Rotation Systems , 2007, Graph Drawing.

[9]  Werner Schwärzler.  On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary , 2009, Comb..

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

[11]  Petr Hlinený.  Crossing number is hard for cubic graphs , 2006, J. Comb. Theory, Ser. B.

[12]  Michael J. Pelsmajer,et al.  Crossing Numbers of Graphs with Rotation Systems , 2007, Algorithmica.

[13]  Martin Grohe,et al.  Computing crossing numbers in quadratic time , 2000, STOC '01.

[14]  Petr Hlinený,et al.  Approximating the Crossing Number of Toroidal Graphs , 2007, ISAAC.

[15]  G. Salazar,et al.  On the crossing number of almost planar graphs , 2006 .

[16]  Markus Chimani,et al.  Vertex insertion approximates the crossing number of apex graphs , 2012, Eur. J. Comb..

[17]  Bojan Mohar.  On the Crossing Number of Almost Planar Graphs , 2006, Informatica.

[18]  Bojan Mohar,et al.  Crossing and Weighted Crossing Number of Near-Planar Graphs , 2009, GD.