Colouring Cayley Graphs
We will discuss three ways to bound the chromatic number on a Cayley graph. 1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will show that Cayley graphs cannot have chromatic number three. 2. We wil...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
University of Waterloo
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/1125 |