On the Parameterized Complexity Of Grid Contraction

Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale

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