Pages that link to "Item:Q5959551"
From MaRDI portal
The following pages link to Sequences of spanning trees and a fixed tree theorem (Q5959551):
Displaying 15 items.
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- A quadratic distance bound on sliding between crossing-free spanning trees (Q883234) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Flips in planar graphs (Q950400) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- On the diameter of geometric path graphs of points in convex position (Q976134) (← links)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
- Transforming spanning trees and pseudo-triangulations (Q1044747) (← links)
- Reconstruction of the path graph (Q1615670) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Bichromatic compatible matchings (Q2354926) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- Transition operations over plane trees (Q5918848) (← links)
