Search
Now showing items 1-1 of 1
Hadwiger's Conjecture On Circular Arc Graphs
(2009-04-30)
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 ...