5 citations · 11 across the 8 of their papers we have counts for
8 papers
Constrained Hitting Set and Steiner Tree in and -free Graphs
S. Dhanalakshmi, N. Sadagopan
\emph{Strictly Chordality- graphs ()} are graphs which are either cycle-free or every induced cycle is of length exactly . Strictly chordality-3 and strictly…
On strictly Chordality-k graphs
S. Dhanalakshmi, N. Sadagopan
Strictly Chordality-k graphs (SC_k graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k, k \geq 3. Note that k = 3 and k = 4 are pre…
On 2K2-free graphs - Structural and Combinatorial View
S. Dhanalakshmi, N. Sadagopan, V. Manogna
A connected graph is 2K2-free if it does not contain a pair of independent edges as an induced subgraph. In this paper, we present the structural characterization of minimal vertex…
Tri-connectivity Augmentation in Trees
S. Dhanalakshmi, N. Sadagopan, D. Sunil Kumar
For a connected graph, a {\em minimum vertex separator} is a minimum set of vertices whose removal creates at least two connected components. The vertex connectivity of the graph r…
Simpler Sequential and Parallel Biconnectivity Augmentation
Surabhi Jain, N. Sadagopan
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinali…
A Dirac-type Characterization of k-chordal Graphs
R. Krithika, Rogers Mathew, N. S. Narayanaswamy +1
Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{á}tal et al. Note: Dirac-type characterizations of graphs without long chordles…