Noncrossing matchings with fixed points
From MaRDI portal
Recommendations
Cited in
(12)- Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- Noncrossing partitions with fixed points having specific properties.
- Annular non-crossing matchings
- On the enumeration of non-crossing pairings of well-balanced binary strings
- scientific article; zbMATH DE number 1998303 (Why is no real title available?)
- A note on enumeration of noncrossing partitions.
- scientific article; zbMATH DE number 2192149 (Why is no real title available?)
- Matching points in compositions and words
- Enumeration of non-crossing pairings on bit strings
- Non-crossing matchings of points with geometric objects
- New variants of perfect non-crossing matchings
This page was built for publication: Noncrossing matchings with fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397266)