research
∙
10/05/2022
On Convexity in Split graphs: Complexity of Steiner tree and Domination
Given a graph G with a terminal set R ⊆ V(G), the Steiner tree problem (...
share
research
∙
07/20/2021
Steiner Tree in k-star Caterpillar Convex Bipartite Graphs – A Dichotomy
The class of k-star caterpillar convex bipartite graphs generalizes the ...
research
∙
07/10/2021
Hamiltonicity: Variants and Generalization in P_5-free Chordal Bipartite graphs
A bipartite graph is chordal bipartite if every cycle of length at least...
research
∙
09/17/2018
Hamiltonicity in Convex Bipartite Graphs
For a connected graph, the Hamiltonian cycle (path) is a simple cycle (p...
research
∙
08/28/2018
On Some Combinatorial Problems in Cographs
The family of graphs that can be constructed from isolated vertices by d...
research
∙
11/25/2017
Hamiltonian Path in Split Graphs- a Dichotomy
In this paper, we investigate Hamiltonian path problem in the context of...
research
∙
11/21/2017
On P_5-free Chordal bipartite graphs
A bipartite graph is chordal bipartite if every cycle of length at least...
research
∙
11/08/2017