31 citations · 298 across the 114 of their papers we have counts for
1 paper · 2 filters
Sergio Cabello, Bojan Mohar
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 gra…