Hardness and Tractability of T_{h+1}-Free Edge Deletion

Ajinkya Gaikwad, Soumen Maity, Leeja R

We study the parameterized complexity of the T(h+1)-Free Edge Deletion problem. Given a graph G and integers k and h, the task is to delete at most k edges so that every connected…