A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general graphs.
|Number of pages||5|
|Journal||Journal of Graph Theory|
|Publication status||Published - 1998|