Given a nonplanar graph $G$ drawn in the plane with crossings. Does there exist a small subset $S$ of edges of $G$ such that after the removal of all edges that intersect or share an endpoint of an edge of $S$, each component of the remaining graph
"separators" for nonplanar graphs embedded in the plane
Hao S
- 111
- 2
- 11