Pages that link to "Item:Q1289020"
From MaRDI portal
The following pages link to Geometric tree graphs of points in convex position (Q1289020):
Displaying 23 items.
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph (Q282748) (← links)
- Production matrices for geometric graphs (Q510608) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- Flips in planar graphs (Q950400) (← links)
- Planar tree transformation: results and counterexample (Q975528) (← links)
- On the diameter of geometric path graphs of points in convex position (Q976134) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
- Reconstruction of the path graph (Q1615670) (← links)
- Characteristic polynomials of production matrices for geometric graphs (Q1689984) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game (Q2205124) (← links)
- The biplanar tree graph (Q2210302) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- On planar path transformation (Q2379998) (← links)
- On maximal chains in the non-crossing partition lattice (Q2451893) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- New production matrices for geometric graphs (Q2666914) (← links)
- (Q4691772) (← links)
- Transition operations over plane trees (Q5918848) (← links)
- Hamilton cycles in the path graph of a set of points in convex position (Q5943288) (← links)
- Sequences of spanning trees and a fixed tree theorem (Q5959551) (← links)
- (Q6179344) (← links)
