Pages that link to "Item:Q2970443"
From MaRDI portal
The following pages link to On self-approaching and increasing-chord drawings of 3-connected planar graphs (Q2970443):
Displaying 18 items.
- (Weakly) self-approaching geometric graphs and spanners (Q1631774) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- Self-approaching paths in simple polygons (Q2173458) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs (Q2936956) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- (Q5092418) (← links)
- Rooted Uniform Monotone Minimum Spanning Trees (Q5283385) (← links)
- Optimal Monotone Drawings of Trees (Q5351867) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Construction and Local Routing for Angle-Monotone Graphs (Q5377357) (← links)
- Increasing-Chord Graphs On Point Sets (Q5899630) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)
- Morphing triangle contact representations of triangulations (Q6050235) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)