Labeled plane trees and increasing plane trees
From MaRDI portal
Cites work
- A context-free grammar for the Ramanujan-Shor polynomials
- A generalization of the Ramanujan polynomials and plane trees
- A grammatical calculus for the Ramanujan polynomials
- A new proof of Cayley's formula for counting labeled trees
- A Ramanujan sequence that refines the Cayley formula for trees
- A universal bijection between Gessel-Stanley permutations and connection diagrams of corresponding ranks
- Bijections in weakly increasing trees via binary trees
- Block patterns in Stirling permutations
- Descents on quasi-Stirling permutations
- Enumerative Combinatorics
- Generalized Stirling permutations, families of increasing trees and urn models
- New refinements of Narayana polynomials and Motzkin polynomials
- Old and young leaves on plane trees
- On the degree distribution of the nodes in increasing trees
- Opérades différentielles graduées sur les simplexes et les permutoèdres
- Pattern restricted quasi-Stirling permutations
- Plane recursive trees, Stirling permutations and an urn model
- Ramanujan grammar and Cayley trees
- Restricted plane tree representations of four Motzkin-Catalan equations
- Stirling polynomials
This page was built for publication: Labeled plane trees and increasing plane trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409370)