Combinatorial generation via permutation languages. VI: Binary trees
From MaRDI portal
Publication:6612300
DOI10.1016/j.ejc.2024.104020zbMATH Open1548.05023MaRDI QIDQ6612300
Petr Gregor, Kumari Namrata, Torsten Mütze
Publication date: 30 September 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
- Pattern avoidance in ordered set partitions
- Non-contiguous pattern avoidance in binary trees
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Pattern avoiding partitions and Motzkin left factors
- Pattern avoidance in labelled trees
- Avoidance of partitions of a three-element set
- Pattern avoidance in binary trees
- On pattern-avoiding partitions
- Consecutive patterns in permutations
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Generalized permutation patterns and a classification of the Mahonian statistics
- Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects
- Rooted forests that avoid sets of permutations
- On \(abab\)-free and \(abba\)-free set partitions
- On multiple pattern avoiding set partitions
- Pattern avoidance in matchings and partitions
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Combinatorial generation via permutation languages. II. Lattice congruences
- Tree series and pattern avoidance in syntax trees
- Unbalanced subtrees in binary rooted ordered and un-ordered trees
- Noncontiguous pattern containment in binary trees
- Counting strings in Dyck paths
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Pattern avoidance in \(k\)-ary heaps
- Pattern avoidance in forests of binary shrubs
- Pattern avoidance for set partitions \`a la Klazar
- The Greedy Gray Code Algorithm
- Pattern Matching in Trees
- A numbering system for binary trees
- On Rotations and the Generation of Binary Trees
- A Survey of Combinatorial Gray Codes
- Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths
- Pattern Avoidance in Ternary Trees
- Avoiding colored partitions of two elements in the pattern sense
- Combinatorial generation via permutation languages. I. Fundamentals
- Algorithmic coincidence classification of mesh patterns
- Combinatorial Gray codes -- an updated survey
- Combinatorial generation via permutation languages. III: Rectangulations
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- Efficient generation of elimination trees and graph associahedra
This page was built for publication: Combinatorial generation via permutation languages. VI: Binary trees