BinaryTrees
From MaRDI portal
Cited in
(41)- A 2D non-overlapping code over a q-ary alphabet
- Rooted forests that avoid sets of permutations
- On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
- OEIS
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
- Classical and consecutive pattern avoidance in rooted forests
- AutoSquared
- Tree series and pattern avoidance in syntax trees
- On generating series of finitely presented operads
- LOU
- Unbalanced subtrees in binary rooted ordered and un-ordered trees
- Noncontiguous pattern containment in binary trees
- Automatic congruences for diagonals of rational functions
- TreePatterns
- Geometric properties of matrices induced by pattern avoidance
- PermLab
- Pattern avoidance in k-ary heaps
- Permutation classes and polyomino classes with excluded submatrices
- CatalanCC
- MotzkinCC
- DelannoyLS
- NAIVE
- DAVID_IAN
- JODO
- BLANKS
- SYMGJ
- SPGJ
- GJseries
- GJSAW
- GJsqfree
- On coincidences of tuples in a binary tree with random labels of vertices
- The Dyck pattern poset
- Toward a language theoretic proof of the four color theorem
- Non-contiguous pattern avoidance in binary trees
- On the sub-permutations of pattern avoiding permutations
- scientific article; zbMATH DE number 7456060 (Why is no real title available?)
- Pattern avoidance in ternary trees
- Pattern-avoiding Dyck paths
- operads
- Pattern avoidance in labelled trees
- Modular Catalan numbers
This page was built for software: BinaryTrees
