✦ LIBER ✦

Decompositions of Leaf-Colored Binary Trees

✍ Scribed by M. Steel

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 786 KB
Volume: 14
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.1993.1001

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Decompositions of Edge-Colored Complete

Decompositions of Edge-Colored Complete Graphs

✍ Esther R. Lamken; Richard M. Wilson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We prove an asymptotic existence theorem for decompositions of edge-colored complete graphs into prespecified edge-colored subgraphs. Many combinatorial design problems fall within this framework. Applications of our main theorem require calculations involving the numbers of edges of each color and

A binary tree decomposition space of per

A binary tree decomposition space of permutation statistics

✍ Don Rawlings 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Decompositions of graphs into trees

✍ Zbigniew Lonc 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 460 KB

Five surprising properties of parsimonio

Five surprising properties of parsimoniously colored trees

✍ Mike Steel; Mike Charleston 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 525 KB

On the Decomposition of Cayley Color Gra

On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees

✍ J.F. Fink 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 579 KB

We prove that if \(\Delta\) is a minimal generating set for a nontrivial group \(\Gamma\) and \(T\) is an oriented tree having \(|\Delta|\) edges, then the Cayley color graph \(D_{\Delta}(\Gamma)\) can be decomposed into \(|\Gamma|\) edge-disjoint subgraphs, each of which is isomorphic to \(T\); we

Equitable Coloring of Trees

✍ B.L. Chen; K.W. Lih 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 224 KB

A graph is equitably \(k\)-colorable if its vertices can be partitioned into \(k\) independent sets of as near equal sizes as possible. Regarding a non-null tree \(T\) as a bipartite graph \(T(X, Y)\), we show that \(T\) is equitably \(k\)-colorable if and only if (i) \(k \geqslant 2\) when ||\(X|-|