A refinement of leaves on noncrossing trees
From MaRDI portal
Publication:1938892
DOI10.1007/s00373-011-1097-zzbMath1258.05052WikidataQ60691937 ScholiaQ60691937MaRDI QIDQ1938892
Publication date: 25 February 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1097-z
05C05: Trees
05A10: Factorials, binomial coefficients, combinatorial functions
05A19: Combinatorial identities, bijective combinatorics
05C30: Enumeration in graph theory
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Consecutive pattern avoidances in non-crossing trees
- Enumerations of ordered trees
- 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
- A bijection on ordered trees and its consequences
- Patterns in trees
- Noncrossing trees and noncrossing graphs
- Pattern Avoidance in Generalized Non-crossing Trees