Reed's Conjecture and Cycle-Power Graphs
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 c...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2014
|
| Subjects: | |
| Online Access: | http://scholarship.claremont.edu/hmc_theses/59 http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1060&context=hmc_theses |