Article contents
The Harmonious Chromatic Number of Almost All Trees
Published online by Cambridge University Press: 12 September 2008
Abstract
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.
For any positive integer m, let Q(m) be the least positive integer k such that ≥ m. We show that for almost all unlabelled, unrooted trees T, h(T) = Q(m), where m is the number of edges of T.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1995
References
- 6
- Cited by