Search
Now showing items 1-5 of 5
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 ...
Boxicity And Cubicity : A Study On Special Classes Of Graphs
(2014-06-02)
Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping f : V (G)→ F such that, An interval graph is an intersection graph of a family of closed intervals on the ...
Boxicity, Cubicity And Vertex Cover
(2010-09-28)
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding ...
Rainbow Colouring and Some Dimensional Problems in Graph Theory
(2018-04-05)
This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity.
Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ...
On Dimensional Parameters Of Graphs And Posets
(2013-06-21)
In this thesis we study the following dimensional parameters : boxicity, cubicity, threshold dimension and poset dimension. While the first three parameters are defined on graphs, poset dimension is defined on partially ...