𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cover of The Color of Trees

The Color of Trees

✍ Scribed by Parker, Canaan


Book ID
110482599
Year
2018
Tongue
English
Weight
139 KB
Category
Fiction
ISBN
1555832075

No coin nor oath required. For personal study only.

✦ Synopsis


What is it like to be gay in a boys’ boarding school? What’s it like to be black, and from Harlem, when you’re 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.


πŸ“œ SIMILAR VOLUMES


cover
✍ 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

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|-|

Minimally colored trees
✍ Ingrid Rinsma; Michael Hendy; David Penny πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 729 KB
Coloring in the tree of life
✍ Jason Raymond πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 96 KB
Coloring of trees with minimum sum of co
✍ Jiang, Tao; West, Douglas B. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 227 KB

The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree with strength k that has maximum degree only 2k -2. The result