BinaryTrees
From MaRDI portal
Software:26186
swMATH14282MaRDI QIDQ26186FDOQ26186
Author name not available (Why is that?)
Cited In (23)
- The Dyck pattern poset
- Non-contiguous pattern avoidance in binary trees
- Classical and consecutive pattern avoidance in rooted forests
- Automatic congruences for diagonals of rational functions
- Geometric properties of matrices induced by pattern avoidance
- On generating series of finitely presented operads
- Unbalanced subtrees in binary rooted ordered and un-ordered trees
- A 2D non-overlapping code over a \(q\)-ary alphabet
- Pattern avoidance in \(k\)-ary heaps
- Pattern avoidance in labelled trees
- Modular Catalan numbers
- On coincidences of tuples in a binary tree with random labels of vertices
- Pattern Avoidance in Ternary Trees
- On the sub-permutations of pattern avoiding permutations
- Toward a language theoretic proof of the four color theorem
- Title not available (Why is that?)
- On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
- Rooted forests that avoid sets of permutations
- Tree series and pattern avoidance in syntax trees
- Permutation classes and polyomino classes with excluded submatrices
- Noncontiguous pattern containment in binary trees
- Title not available (Why is that?)
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
This page was built for software: BinaryTrees
