The following pages link to Untangling a planar graph (Q1042455):
Displaying 13 items.
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Untangling polygons and graphs (Q848672) (← links)
- \(\beta\)-stars or on extending a drawing of a connected subgraph (Q1725776) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← 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)
