Premium
On the harmonious coloring of collections of graphs
Author(s) -
Georges John P.
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190200213
Subject(s) - combinatorics , bipartite graph , mathematics , disjoint sets , complete coloring , edge coloring , list coloring , complete bipartite graph , graph , discrete mathematics , graph power , line graph
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 4 m ‐cycles. © 1995, John Wiley & Sons, Inc.