Pages that link to "Item:Q1865140"
From MaRDI portal
The following pages link to Graphs of non-crossing perfect matchings (Q1865140):
Displaying 18 items.
- Kauffman's clock lattice as a graph of perfect matchings: a formula for its height (Q470959) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- On planar path transformation (Q2379998) (← links)
- The absolute order of a permutation representation of a Coxeter group (Q2441565) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Graphs of triangulations and perfect matchings (Q2573802) (← links)
- Notes on the Twisted Graph (Q4899270) (← links)
- On the flip graphs on perfect matchings of complete graphs and signed reversal graphs (Q5026994) (← links)
- (Q5090955) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- On flips in planar matchings (Q5919054) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
