On the harmonious coloring of collections of graphs
John P. Georges · Journal of Graph Theory · 1995
Abstract The hermonious coloring number of the graph G, HC(G), is the smallest number of colors needed to label the vertices of G such that adjacent vertices received different colors and no two edges are incident with the same color pair. In this paper, we investigate the HC‐number of collections of disjoint paths, cycles, complete graphs, and complete bipartite graphs. We determine exact expressions for the HC‐number of collections of paths and 4m‐cycles. © 1995, John Wiley & Sons, Inc.