A decomposition algorithm for noncrossing trees
From MaRDI portal
Publication:405065
zbMath1300.05302MaRDI QIDQ405065
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p5
05C05: Trees
05A15: Exact enumeration problems, generating functions
05C30: Enumeration in graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The cyclic sieving phenomenon for non-crossing forests
- Consecutive pattern avoidances in non-crossing trees
- Dyck paths with coloured ascents
- Dyck path enumeration
- Analytic combinatorics of non-crossing configurations
- Enumeration of noncrossing trees on a circle
- Descents in noncrossing trees
- Bijections for ternary trees and non-crossing trees
- Statistics on non-crossing trees
- Noncrossing trees and noncrossing graphs
- A general bijective algorithm for trees.