Pages that link to "Item:Q1028225"
From MaRDI portal
The following pages link to Transforming spanning trees: A lower bound (Q1028225):
Displaying 11 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)
- Planar tree transformation: results and counterexample (Q975528) (← links)
- Transforming spanning trees and pseudo-triangulations (Q1044747) (← links)
- Bichromatic compatible matchings (Q2354926) (← links)
- Lower-stretch spanning trees (Q3581444) (← links)
- (Q5461426) (← links)
- Transition operations over plane trees (Q5918848) (← links)
- Transformations of a graph increasing its Laplacian polynomial and number of spanning trees (Q5961460) (← links)
- Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078) (← links)