Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph

@inproceedings{Schaefer2014PickingPE,
  title={Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph},
  author={Marcus Schaefer},
  booktitle={Graph Drawing},
  year={2014}
}
Given a graph G and a subset F ⊆ E(G) of its edges, is there a drawing ofG in which all edges of F are free of crossings? We show that this question can be solved in polynomial time using a Hanani-Tutte style approach. If we require the drawing of G to be straight-line, and allow at most one crossing along each edge in F , the problem turns out to be as hard as the existential theory of the real numbers. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
3 Extracted Citations
24 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 24 references

Toward a theory of crossing numbers

  • William T. Tutte
  • J. Combinatorial Theory,
  • 1970
Highly Influential
5 Excerpts

Über wesentlich unplättbare Kurven im drei-dimensionalen Raume

  • Chaim Chojnacki Haim Hanani
  • Fundamenta Mathematicae,
  • 1934
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…