Decomposition and merging algorithms for noncrossing forests
From MaRDI portal
Recommendations
Cites work
- A decomposition algorithm for noncrossing trees
- A general bijective algorithm for trees.
- Analytic combinatorics of non-crossing configurations
- Bijections for ternary trees and non-crossing trees
- Consecutive pattern avoidances in non-crossing trees
- Descents in noncrossing trees
- Dyck paths with coloured ascents
- Enumeration of noncrossing trees on a circle
- scientific article; zbMATH DE number 6683596 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Noncrossing trees and noncrossing graphs
- Statistics on non-crossing trees
- The cyclic sieving phenomenon for non-crossing forests
Cited in
(2)
This page was built for publication: Decomposition and merging algorithms for noncrossing forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2062886)