Pattern-avoiding binary trees -- generation, counting, and bijections
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- A Survey of Combinatorial Gray Codes
- A numbering system for binary trees
- Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects
- Avoidance of partitions of a three-element set
- Avoiding colored partitions of two elements in the pattern sense
- Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths
- Combinatorial Gray codes -- an updated survey
- Combinatorial generation via permutation languages. I: Fundamentals
- Combinatorial generation via permutation languages. III: Rectangulations
- Consecutive patterns in permutations
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Counting strings in Dyck paths
- Generalized permutation patterns and a classification of the Mahonian statistics
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Non-contiguous pattern avoidance in binary trees
- Noncontiguous pattern containment in binary trees
- On Rotations and the Generation of Binary Trees
- On \(abab\)-free and \(abba\)-free set partitions
- On multiple pattern avoiding set partitions
- On pattern-avoiding partitions
- Pattern avoidance for set partitions à la Klazar
- Pattern avoidance in k-ary heaps
- Pattern avoidance in binary trees
- Pattern avoidance in forests of binary shrubs
- Pattern avoidance in matchings and partitions
- Pattern avoidance in ordered set partitions
- Pattern avoidance in set partitions.
- Pattern avoidance in ternary trees
- Pattern avoiding partitions and Motzkin left factors
- Pattern avoiding partitions, sequence A054391, and the kernel method
- Pattern-avoiding Dyck paths
- Rooted forests that avoid sets of permutations
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- The greedy Gray code algorithm
- Tree series and pattern avoidance in syntax trees
- Unbalanced subtrees in binary rooted ordered and un-ordered trees
This page was built for publication: Pattern-avoiding binary trees -- generation, counting, and bijections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953186)
