2 papers
cs.DM2023
-binding functions for squares of bipartite graphs and its subclasses
Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob +1
A class of graphs is -bounded if there exists a function such that for each graph , where and are the chro…
cs.DS2022
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri +1
In this paper, we study the computational complexity of \textsc{-Club Cluster Vertex Deletion}. Given a graph, \textsc{-Club Cluster Vertex Deletion (-CVD)} aims to delete…