𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the Horton-Strahler number for random trees

✍ Scribed by Luc Devroye; Paul Kruszewski

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
408 KB
Volume
56
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Note on the m-Bounded Chromatic Number
A Note on the m-Bounded Chromatic Number of a Tree
✍ Bor-Liang Chen; Ko-Wei Lih πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 77 KB

The \(m\)-bounded chromatic number of a graph \(G\) is the smallest number of colors required for a proper coloring of \(G\) in which each color is used at most \(m\) times. We will establish an exact formula for the \(m\)-bounded chromatic number of a tree.