Pages that link to "Item:Q3276708"
From MaRDI portal
The following pages link to The Enumeration of Trees by Height and Diameter (Q3276708):
Displayed 9 items.
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- A new bijection on rooted forests (Q686461) (← links)
- The average height of binary trees and other simple trees (Q1171885) (← links)
- The outer-distance of nodes in random trees (Q1173095) (← links)
- The distribution of height and diameter in random non-plane binary trees (Q3165458) (← links)
- A Random Graph With a Subcritical Number of Edges (Q3807259) (← links)
- (Q4111582) (← links)
- An application of graphical enumeration to PA * (Q4457723) (← links)
- Random-tree Diameter and the Diameter-constrained MST (Q4551459) (← links)