๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimally colored trees

โœ Scribed by Ingrid Rinsma; Michael Hendy; David Penny

Book ID
116029558
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
729 KB
Volume
98
Category
Article
ISSN
0025-5564

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Decompositions of Leaf-Colored Binary Tr
Decompositions of Leaf-Colored Binary Trees
โœ M. Steel ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 786 KB

Leaf-colored binary trees, with an induced integer "length," arise in biomathematics. We analyse such trees in terms of a natural bipartition of their edge set, and, extending a recent decomposition for binary trees, obtain enumerative formulae. 1993 Academic Press. Inc.

On an Extremal Problem for Colored Trees
On an Extremal Problem for Colored Trees
โœ P. Valtr ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 93 KB

Let T be a tree such that there is a proper n-coloring c of the vertices of T which, besides a technical condition, is a k b k a k -free, i.e., T contains no subdivision of a path u 1 , . . . , Then T has O(kn) vertices. (The technical condition requires that T contains no subdivision of a properly