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. We obtain a new lower bound for the harmonious chromatic number of general graphs, in terms of the independence number of the graph, generalizing results of Moser[2].
| Original language | English |
|---|---|
| Pages (from-to) | 99-102 |
| Number of pages | 4 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 29 |
| Publication status | Published - 2004 |