On the enumeration of certain sets of planted plane trees
From MaRDI portal
Publication:1216321
DOI10.1016/0095-8956(75)90049-0zbMath0304.05113OpenAlexW2075970910MaRDI QIDQ1216321
I. Z. Chorneyko, Sri Gopal Mohanty
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90049-0
Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
A new combinatorial interpretation for generalized Catalan number ⋮ On a theorem of Chorneyko and Mohanty ⋮ Identities of Rothe-Abel-Schläfli-Hurwitz-type ⋮ Higher dimensional lattice paths with diagonal steps ⋮ Enumeration of higher-dimensional paths under restrictions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the enumeration of two-coloured, rooted and weighted plane trees
- A Generalization of the Ballot Problem and its Application in the Theory of Queues
- A note on plane trees
- Ballots and trees
- A note on the enumeration of line chromatic trees
- Correspondences between plane trees and binary sequences
- Some Properties of Compositions and their Application to the Ballot Problem
- A Short Proof of Steck's Result on Two-Sample Smirnov Statistics
- The Number of Planted Plane Trees with a Given Partition
This page was built for publication: On the enumeration of certain sets of planted plane trees