Login / Signup
Adding one edge to planar graphs makes crossing number and 1-planarity hard
Sergio Cabello
Bojan Mohar
Published in:
CoRR (2012)
Keyphrases
</>
planar graphs
special case
greedy algorithm