Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...

If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...

My general research interest is in the area of combinatorics (graph theory) and algebra. My first exposure to research is through graph labeling when I was an undergraduate student. During my PhD, I ...