The following pages link to Compatible geometric matchings (Q924079):
Displaying 23 items.
- Convex partitions with 2-edge connected dual graphs (Q652620) (← links)
- On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\) (Q1602691) (← links)
- Point sets with many non-crossing perfect matchings (Q1699275) (← links)
- Linear transformation distance for bichromatic matchings (Q1699281) (← links)
- Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings (Q1756102) (← links)
- Graphs of non-crossing perfect matchings (Q1865140) (← links)
- Disjoint compatible geometric matchings (Q1942309) (← links)
- On compatible matchings (Q2232249) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Flip distance to some plane configurations (Q2331207) (← links)
- Bichromatic compatible matchings (Q2354926) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Matching edges and faces in polygonal partitions (Q2462737) (← links)
- Graphs of triangulations and perfect matchings (Q2573802) (← links)
- Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- Augmenting Geometric Graphs with Matchings (Q5014140) (← links)
- On Compatible Matchings (Q5049995) (← links)
- Packing 1-plane Hamiltonian cycles in complete geometric graphs (Q5080782) (← links)
- Crossing matchings and circuits have maximal length (Q5110683) (← links)
- Convex Partitions with 2-Edge Connected Dual Graphs (Q5323063) (← links)
