Search
Now showing items 1-2 of 2
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 ...
The Isoperimetric Problem On Trees And Bounded Tree Width Graphs
(2010-08-26)
In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G = (V,E) be a finite, simple and undirected graph. For let δ(S,G)= {(u,v) ε E : u ε S and v ε V – S }be the edge boundary ...