Pages that link to "Item:Q1699275"
From MaRDI portal
The following pages link to Point sets with many non-crossing perfect matchings (Q1699275):
Displaying 7 items.
- Perfect matchings with crossings (Q2169938) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- (Q5088963) (← links)
- Perfect matchings with crossings (Q6119827) (← links)
