Constrained Hitting Set and Steiner Tree in $S{C}_k$ and $2K_2$-free Graphs

Abstract

\emph{Strictly Chordality-$k$ graphs ($S{C}_k$)} are graphs which are either cycle-free or every induced cycle is of length exactly $k,k\ge 3$. Strictly chordality-3 and strictly chordality-4 graphs are well known chordal and chordal bipartite graphs, respectively. For $k\ge 5$, the study has been recently initiated in \cite{sadagopan} and various structural and algorithmic results are reported. In this paper, we show that maximum independent set (MIS), minimum vertex cover, minimum dominating set, feedback vertex set (FVS), odd cycle transversal (OCT), even cycle transversal (ECT) and Steiner tree problem are polynomial time solvable on $S{C}_k$ graphs, $k\ge 5$. We next consider $2K_2$-free graphs and show that FVS, OCT, ECT, Steiner tree problem are polynomial time solvable on subclasses of $2K_2$-free graphs.

15 pages, 3 figures, submitted to CALDAM 2017. arXiv admin note: text overlap with arXiv:1602.03802

References in corpus (2)

• On 2K2-free graphs - Structural and Combinatorial View
• On strictly Chordality-k graphs