✦ LIBER ✦

The irregular coloring number of a tree

✍ Scribed by Anita C. Burris

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 289 KB
Volume: 141
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0225-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the irregularity strength of trees

✍ Tom Bohman; David Kravitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract For any graph __G__, let __n~i~__ be the number of vertices of degree __i__, and $\lambda (G)={max} \_{i\le j}\{ {n\_i+\cdots +n\_j+i-1\over j}\}$. This is a general lower bound on the irregularity strength of graph __G__. All known facts suggest that for connected graphs, this is the a

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 Game Coloring Number of Planar Graph

The Game Coloring Number of Planar Graphs

✍ Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 121 KB

This paper discusses a variation of the game chromatic number of a graph: the game coloring number. This parameter provides an upper bound for the game chromatic number of a graph. We show that the game coloring number of a planar graph is at most 19. This implies that the game chromatic number of a

The Color-Degree Matrix and the Number o

The Color-Degree Matrix and the Number of Multicolored Trees in Star Decompositions

✍ J.Q. Liu; A.J. Schwenk 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 473 KB

In a previous paper we investigated the problem of counting the number of multicolored spanning trees in biclique decompositions. In particular, for acyclic decompositions we found the minimum and maximum numbers of multicolored trees. We now introduce the color-degree matrix $C$ and show that the

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

The number of trees with a 1-factor

✍ J.W. Moon 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 608 KB

The asymptotic behaviour of the number of trees with a 1-factor is determined for various families of trees