Pages that link to "Item:Q2573802"
From MaRDI portal
The following pages link to Graphs of triangulations and perfect matchings (Q2573802):
Displaying 15 items.
- 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)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- Flip Graphs of Bounded-Degree Triangulations (Q2851510) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- Triangulability of convex graphs and convex skewness (Q5083873) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- Compatible Geometric Matchings (Q5301007) (← 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)
