Recommendations
- Ordered trees and non-crossing partitions
- On tree partitions
- TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
- On tree-partitions of graphs
- On the partition dimension of trees
- Partitions and labeled trees
- Partition complexes and trees
- Aronszajn trees and partitions
- Partitionability of trees
- Partitions and normal trees
Cites work
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 863508 (Why is no real title available?)
- scientific article; zbMATH DE number 888842 (Why is no real title available?)
- A general bijective algorithm for trees.
- Catalan numbers revisited
- Chain enumeration and non-crossing partitions
- Combinatorial aspects of Davenport-Schinzel sequences
- Combinatorial statistics on non-crossing partitions
- Enumerating Davenport-Schinzel sequences
- Linear trees and RNA secondary structure
- On \(abab\)-free and \(abba\)-free set partitions
- On some new sequences generalizing the Catalan and Motzkin numbers
- On the structure of the lattice of noncrossing partitions
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
Cited in
(36)- A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions
- A bijection between nonnegative words and sparse \(abba\)-free partitions
- Partitions and partial matchings avoiding neighbor patterns
- Club-guessing and non-structure of trees
- Partitions, Kostka polynomials and pairs of trees
- Enumeration of connected Catalan objects by type
- Set partitions avoid a four-letter pattern
- Graham's tree reconstruction conjecture and a Waring-type problem on partitions
- Enumeration of (k,2)-noncrossing partitions
- On tree partitions
- Combinatorial statistics on non-crossing partitions
- Counting complements in the partition lattice, and hypertrees
- Regular simple queues of protein contact maps
- Reduction of \(m\)-regular noncrossing partitions
- Sets, Lists and Noncrossing Partitions
- scientific article; zbMATH DE number 2197882 (Why is no real title available?)
- A bijective proof of an identity for noncrossing graphs
- A bijection between certain non-crossing partitions and sequences
- Simply generated non-crossing partitions
- m-Noncrossing trees
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions
- scientific article; zbMATH DE number 2077656 (Why is no real title available?)
- On partitions avoiding 3-crossings
- Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.
- Algorithms for non-crossing partitions
- Partitions of a set satisfying certain set of conditions
- Combinatorics of non-ambiguous trees
- Bijections between bicoloured ordered trees and non-crossing partitions.
- Some set partition statistics in non-crossing partitions and generating functions
- scientific article; zbMATH DE number 3957131 (Why is no real title available?)
- Aronszajn trees and partitions
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- Crossed partitions
- RNA secondary structures with given motif specification: combinatorics and algorithms
- Identities for non-crossing graphs and multigraphs
- TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
This page was built for publication: On trees and noncrossing partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383385)
