The following pages link to Untangling a Planar Graph (Q5448674):
Displayed 6 items.
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Untangling polygons and graphs (Q5301008) (← links)
- A Polynomial Bound for Untangling Geometric Planar Graphs (Q5301009) (← links)