The following pages link to Flips in planar graphs (Q950400):
Displaying 7 items.
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- How close is a quad mesh to a polycube? (Q6101842) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Optimal Area Polygonization by Triangulation and Visibility Search (Q6163583) (← links)
- Flip distance and triangulations of a polyhedron (Q6540258) (← links)
- Switches in Eulerian graphs (Q6621269) (← links)