Enumerations of ordered trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3573876 (Why is no real title available?)
- scientific article; zbMATH DE number 3448641 (Why is no real title available?)
- scientific article; zbMATH DE number 3270295 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A problem of arrangements
- Generating Binary Trees Lexicographically
Cited in
(41)- A note on generating binary trees inA-order andB-order
- The permuted analogues of three Catalan sets
- A pattern of asymptotic vertex valency distributions in planar maps
- Generating trees withnnodes andmleaves
- A refinement of Dyck paths: A combinatorial approach
- XML compression via directed acyclic graphs
- Parametric analysis of RNA branching configurations
- A correspondence between ordered trees and noncrossing partitions
- A new combinatorial interpretation for generalized Catalan number
- Two shortest path metrics on well-formed parentheses strings
- Enumerations of plane trees with multiple edges and Raney lattice paths
- Pattern avoidance in weak ascent sequences
- A Combinatorial Bijection between Ordered Trees and Lattice Paths
- A shift Gray code for fixed-content Łukasiewicz words
- On quasi-polynomials counting planar tight maps
- Ordered trees and the inorder traversal
- Permutations, parenthesis words, and Schröder numbers
- Some remarks on Catalan families
- Dyck path enumeration
- Enumerations of rooted trees with an application to group presentations
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- A bijection on ordered trees and its consequences
- On the average oscillation of a stack
- Nonleaf patterns in trees: protected nodes and fine numbers
- Odd or even on plane trees
- The butterfly decomposition of plane trees
- 2-binary trees: bijections and related issues
- A refinement of leaves on noncrossing trees
- Ordered trees and non-crossing partitions
- Patterns in trees
- Protected Branches in Ordered Trees
- Six etudes in generating functions
- The expected additive weight of trees
- The number of coverings in four catalan lattices
- Combinatorics of diagonally convex directed polyominoes
- An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees
- RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
- A simple proof of a formula of Dershowitz and Zaks
- Skew diagrams and ordered trees
- Motzkin paths with a restricted first return decomposition
- Sur la génération des arbres binaires par les B-suites
This page was built for publication: Enumerations of ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144044)
