✦ LIBER ✦

The number of ways of coloring the branches of a tree and a multitree

✍ Scribed by Ya. Ya. Kalnin'sh

Publisher: Springer US
Year: 1965
Tongue: English
Weight: 157 KB
Volume: 1
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01074706

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The irregular coloring number of a tree

✍ Anita C. Burris 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Codifying trees and multitrees of a comp

Codifying trees and multitrees of a complete graph

✍ Wai-Kai Chen 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 739 KB

## Simple codes for trees and multitrees of a complete graph are presented. They can be used rather eficiently for the generation of all possible trees and multitrees of a complete or nearly complete graph. With minor nwdi$cations, the code can also be used as a generating function for labeled tre

The color of trees: a novel

✍ Parker, Canaan 📂 Fiction 📅 1992 🏛 Alyson 🌐 English ⚖ 128 KB 👁 2 views

What is it like to be gay in a boys boarding school? Whats it like to be black, and from Harlem, when youre surrounded by privileged white boys? A story of young love that crosses racial and class boundaries, this hauntingly erotic first novel explores the limits of freedom and loyalty. Has Cover

The coloring of graphs in a linear numbe

The coloring of graphs in a linear number of steps

✍ A. A. Kalnin'sh 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 830 KB

Characterization of a Branch of the Phyl

Characterization of a Branch of the Phylogenetic Tree

✍ STUART A. SAMUEL; GEZHI WENG 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We use a combination of analytic models and computer simulations to gain insight into the dynamics of evolution. Our results suggest that certain interesting phenomena should eventually emerge from the fossil record. For example, there should be a "tortoise and hare effect": those genera with the sm

Note on a new coloring number of a graph

✍ P. Horák; J. Širáň 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

## Abstract The distance coloring number __X__~__d__~(__G__) of a graph __G__ is the minimum number __n__ such that every vertex of __G__ can be assigned a natural number __m__ ≤ __n__ and no two vertices at distance __i__ are both assigned __i__. It is proved that for any natural number __n__ ther