Search
Now showing items 1-2 of 2
Algorithmic and Combinatorial Questions on Some Geometric Problems on Graphs
(2018-05-08)
This thesis mainly focuses on algorithmic and combinatorial questions related to some geometric problems on graphs. In the last part of this thesis, a graph coloring problem is also discussed.
Boxicity and Cubicity: These ...
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 ...