Pages that link to "Item:Q924163"
From MaRDI portal
The following pages link to On the obfuscation complexity of planar graphs (Q924163):
Displayed 9 items.
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Untangling polygons and graphs (Q848672) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
- On Collinear Sets in Straight-Line Drawings (Q3104785) (← links)
- Geometry and Generation of a New Graph Planarity Game (Q5233138) (← links)
- Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)