Enumerations of ordered trees
From MaRDI portal
Publication:1144044
DOI10.1016/0012-365X(80)90168-5zbMath0443.05049WikidataQ56169635 ScholiaQ56169635MaRDI QIDQ1144044
Nachum Dershowitz, Shmuel Zaks
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Skew diagrams and ordered trees, Parametric analysis of RNA branching configurations, Sur la génération des arbres binaires par les B-suites, A correspondence between ordered trees and noncrossing partitions, A new combinatorial interpretation for generalized Catalan number, Some remarks on Catalan families, Ordered trees and non-crossing partitions, Enumerations of rooted trees with an application to group presentations, The permuted analogues of three Catalan sets, The expected additive weight of trees, Dyck path enumeration, A pattern of asymptotic vertex valency distributions in planar maps, RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm., Permutations, parenthesis words, and Schröder numbers, Odd or even on plane trees, On the average oscillation of a stack, A simple proof of a formula of Dershowitz and Zaks, Combinatorics of diagonally convex directed polyominoes, An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees, A bijection on ordered trees and its consequences, Patterns in trees, The butterfly decomposition of plane trees, 2-binary trees: bijections and related issues, Ordered trees and the inorder traversal, The number of coverings in four catalan lattices, Quasi-Monotonic Sequences: Theory, Algorithms and Applications, A note on generating binary trees inA-order andB-order, Generating trees withnnodes andmleaves, Six etudes in generating functions
Cites Work
