Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs

DOI10.21494/ISTE.OP.2023.0903zbMATH Open1520.05056arXiv1610.00853MaRDI QIDQ6136471FDOQ6136471

S. Dhanalakshmi, N. Sadagopan

Publication date: 31 August 2023

Published in: Advances in Pure and Applied Mathematics (Search for Journal in Brave)

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,kgeq3$. Strictly chordality-3 and strictly chordality-4 graphs are well known chordal and chordal bipartite graphs, respectively. For $kgeq5$, 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, $kgeq5$. 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.

Full work available at URL: https://arxiv.org/abs/1610.00853

Recommendations

• On strictly chordality-\(k\) graphs
• Steiner trees for hereditary graph classes: a treewidth perspective
• Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy
• Doubly chordal graphs, steiner trees, and connected domination
• Tree polytope on 2-trees

zbMATH Keywords

Steiner treefeedback vertex set\(2K_2\)-free graphsodd (Even) cycle transversalstrictly chordality-\(k\) graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Paths and cycles (05C38) Transversal (matching) theory (05D15)

Cites Work

• Title not available (Why is that?)
• Node-and edge-deletion NP-complete problems
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• The complexity of generalized clique covering
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Dominating sets for split and bipartite graphs
• Dominating Sets in Chordal Graphs
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• Steiner trees, connected domination and strongly chordal graphs
• Hamiltonian circuits in interval graph generalizations
• Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
• On strictly chordality-\(k\) graphs
• Parameterized Algorithms for Even Cycle Transversal

This page was built for publication: Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136471)