Pages that link to "Item:Q2501001"
From MaRDI portal
The following pages link to Noncrossing trees and noncrossing graphs (Q2501001):
Displaying 16 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)
- Identities for non-crossing graphs and multigraphs (Q998488) (← links)
- 2-noncrossing trees and 5-ary trees (Q1045110) (← links)
- The pessimistic search and the straightening involution for trees (Q1266368) (← links)
- Enumeration of noncrossing trees on a circle (Q1381832) (← links)
- Descents in noncrossing trees (Q1422136) (← links)
- Bijections for ternary trees and non-crossing trees (Q1613443) (← links)
- A bijective proof of an identity for noncrossing graphs (Q1861266) (← 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)
- 2-binary trees: bijections and related issues (Q2470000) (← links)
- m-Noncrossing trees (Q4561478) (← links)