Hadwiger's Conjecture On Circular Arc Graphs
Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at least k. In this thesis, we give motivation for attempting Hadwiger’s conjecture...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2005/475 |