Reed's Conjecture and Cycle-Power Graphs
Alexa Serrato · Scholarship @ Claremont (The Claremont Colleges) · 2014
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.