
Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms
In an undirected graph G=(V,E), we say (A,B) is a pair of perfectly matc...
read it

An FPT algorithm for Matching Cut
In an undirected graph, a matching cut is an edge cut which is also a ma...
read it

Planar projections of graphs
We introduce and study a new graph representation where vertices are emb...
read it

Structure and colour in trianglefree graphs
Motivated by a recent conjecture of the first author, we prove that ever...
read it

Bipartitioning Problems on Graphs with Bounded TreeWidth
For an undirected graph G, we consider the following problems: given a f...
read it
N. R. Aravind
is this you? claim profile