✦ LIBER ✦

Coloring of trees with minimum sum of colors

✍ Scribed by Jiang, Tao; West, Douglas B.

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 227 KB
Volume: 32
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199912)32:4<354::aid-jgt4>3.0.co;2-b

No coin nor oath required. For personal study only.

✦ Synopsis

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 is best possible.

📜 SIMILAR VOLUMES

Minimum Color Sum of Bipartite Graphs

✍ Amotz Bar-Noy; Guy Kortsarz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 242 KB

The problem of minimum color sum of a graph is to color the vertices of the Ž . graph such that the sum average of all assigned colors is minimum. Recently it was shown that in general graphs this problem cannot be approximated within 1y ⑀ Ž n , for any ⑀ ) 0, unless NP s ZPP Bar-Noy et al., Informa

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

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

List circular coloring of trees and cycl

List circular coloring of trees and cycles

✍ André Raspaud; Xuding Zhu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract Suppose __G__=(__V__, __E__) is a graph and __p__ ≥ 2__q__ are positive integers. A (__p__, __q__)‐coloring of __G__ is a mapping ϕ: __V__ → {0, 1, …, __p__‐1} such that for any edge __xy__ of __G__, __q__ ≤ |ϕ(__x__)‐ϕ(__y__)| ≤ __p__‐__q__. A color‐list is a mapping __L__: __V__ → $\c

Kr-Free Uniquely Vertex Colorable Graphs

Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges

✍ S. Akbari; V.S. Mirrokni; B.S. Sadjad 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 112 KB

We construct counterexamples to the conjecture of Xu (1990, J. Combin. Theory Ser. B 50, 319 320) that every uniquely r-colorable graph of order n with exactly (r&1) n&( r2 ) edges must contain a K r . ## 2001 Academic Press Harary et al. [4] constructed uniquely r-colorable graphs containing no

Colored Homomorphisms of Colored Mixed G

Colored Homomorphisms of Colored Mixed Graphs

✍ Jaroslav Nešetřil; André Raspaud 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 108 KB

The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic coloring number and oriented chromatic number, have been recently studied. Improving and combining earlier techniques of N.