Ordered trees with prescribed root degrees, node degrees, and branch lengths
From MaRDI portal
Publication:1827732
DOI10.1016/j.disc.2003.10.021zbMath1042.05026OpenAlexW2031309768MaRDI QIDQ1827732
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.10.021
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
Protected Branches in Ordered Trees ⋮ Unnamed Item ⋮ Injectively \(k\)-colored rooted forests ⋮ Unnamed Item ⋮ Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences ⋮ Some asymptotic results of Gaussian random fields with varying mean functions and the associated processes ⋮ The number of convex permutominoes ⋮ Parametric analysis of RNA branching configurations ⋮ Klazar trees and perfect matchings ⋮ Dendriform equations ⋮ Ordered trees and the inorder traversal ⋮ On the conditional distributions and the efficient simulations of exponential integrals of Gaussian random fields ⋮ Weakly protected points in ordered trees ⋮ Enumerating several aspects of non-decreasing Dyck paths
Uses Software
Cites Work
- Enumeration of plane trees by branches and endpoints
- Restricted plane tree representations of four Motzkin-Catalan equations
- Catalan, Motzkin, and Riordan numbers
- Dyck path enumeration
- Diagonally convex directed polyominoes and even trees: A bijection and related issues
- A bijection between ordered trees and 2-Motzkin paths and its many consequences
- Correspondences between plane trees and binary sequences
- Motzkin numbers
- A survey of the Fine numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ordered trees with prescribed root degrees, node degrees, and branch lengths
