The star chromatic and the harmonious chromatic numbers of a graph
Abstract
In this dissertation, we study two variations of the chromatic number of a graph. The first is the star chromatic number which was defined by Vince. This parameter is based on the idea of coloring the vertices of a graph with integers (modulo k) in such a way that the colors on adjacent vertices are as far apart as possible. The second variation is the harmonious chromatic number, which was introduced by Miller and Pritikin. It is defined to be the minimum number of colors needed to color the vertices of a graph so that adjacent vertices are colored differently and no two edges have the same pair of colors on their end vertices.
Degree
Ph.D.
Advisors
Beineke, Purdue University.
Subject Area
Mathematics
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.