The following pages link to Locally oriented noncrossing trees (Q888594):
Displaying 12 items.
- A decomposition algorithm for noncrossing trees (Q405065) (← links)
- 2-noncrossing trees and 5-ary trees (Q1045110) (← links)
- Bijections for ternary trees and non-crossing trees (Q1613443) (← links)
- Statistics on non-crossing trees (Q1613530) (← links)
- A refinement of leaves on noncrossing trees (Q1938892) (← links)
- Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections (Q2033473) (← links)
- Decomposition and merging algorithms for noncrossing forests (Q2062886) (← links)
- Noncrossing trees and noncrossing graphs (Q2501001) (← links)
- Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\) (Q2684899) (← links)
- (Q6101498) (← links)
- Random matrices associated to Young diagrams (Q6192467) (← links)
- The combinatorics behind the leading Kazhdan-Lusztig coefficients of braid matroids (Q6614176) (← links)
