Pages that link to "Item:Q534342"
From MaRDI portal
The following pages link to Untangling planar graphs from a specified vertex position-Hard cases (Q534342):
Displayed 5 items.
- Untangling polygons and graphs (Q848672) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- Untangling a planar graph (Q1042455) (← links)
- On Collinear Sets in Straight-Line Drawings (Q3104785) (← links)
- Upper Bound Constructions for Untangling Planar Geometric Graphs (Q3223962) (← links)