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

The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees

โœ Scribed by John Mitchem; Ed Schmeichel


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
409 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The exact value of the harmonious chroma
โœ 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