Open Access Senior Thesis
Bachelor of Science
© 2014 Alexa Serrato
Reed's conjecture is a proposed upper bound for the chromatic number of a graph. Reed's conjecture has already been proven for several families of graphs. In this paper, I show how one of those families of graphs can be extended to include additional graphs and also show that Reed's conjecture holds for a family of graphs known as cycle-power graphs, and also for their complements.
Serrato, Alexa, "Reed's Conjecture and Cycle-Power Graphs" (2014). HMC Senior Theses. 59.