Pages that link to "Item:Q1042452"
From MaRDI portal
The following pages link to A polynomial bound for untangling geometric planar graphs (Q1042452):
Displaying 11 items.
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Untangling polygons and graphs (Q848672) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q1942307) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- Dual circumference and collinear sets (Q2679595) (← links)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)
- On Collinear Sets in Straight-Line Drawings (Q3104785) (← links)
- Upper Bound Constructions for Untangling Planar Geometric Graphs (Q3223962) (← links)
- (Q5088959) (← links)
- Geometry and Generation of a New Graph Planarity Game (Q5233138) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)
