On the Parameterized Complexity of Contraction to Generalization of Trees

Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale

For a family of graphs $\mathcal{F}$, the $\mathcal{F}$-Contraction problem takes as an input a graph $G$ and an integer $k$, and the goal is to decide if there exists $S \subseteq E(G)…