An upper bound for the harmonious chromatic number of a graph |
| |
Authors: | Sin-Min Lee John Mitchem |
| |
Abstract: | An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. |
| |
Keywords: | |
|
|