๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The harmonious chromatic number of complete r-ary trees

โœ Scribed by Keith Edwards

Book ID
108316339
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
125 KB
Volume
203
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The exact value of the harmonious chroma
The exact value of the harmonious chromatic number of a complete binary tree
โœ Zhikang Lu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 400 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colors needed to color the vertices of G in such a way that adjacent vertices are colored by different colors and any two distinct edges receive different color pairs. D. Johnson has shown that the problem of deter

On the harmonious chromatic number of a
On the harmonious chromatic number of a graph
โœ John Mitchem ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe