The following pages link to Statistics on non-crossing trees (Q1613530):
Displaying 15 items.
- A decomposition algorithm for noncrossing trees (Q405065) (← links)
- Consecutive pattern avoidances in non-crossing trees (Q607683) (← links)
- Locally oriented noncrossing trees (Q888594) (← links)
- Dyck paths with coloured ascents (Q925029) (← links)
- 2-noncrossing trees and 5-ary trees (Q1045110) (← links)
- A refinement of leaves on noncrossing trees (Q1938892) (← links)
- Decomposition and merging algorithms for noncrossing forests (Q2062886) (← links)
- Nested Catalan tables and a recurrence relation in noncommutative quantum field theory (Q2124254) (← links)
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees (Q2359736) (← links)
- Extremal statistics on non-crossing configurations (Q2449168) (← links)
- 2-binary trees: bijections and related issues (Q2470000) (← links)
- (Q4561335) (← links)
- Edge crossings in random linear arrangements (Q5135062) (← links)
- Simply Generated Non-Crossing Partitions (Q5366962) (← links)
- (Q6101498) (← links)
