Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent

Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov +4

For a graph class $\mathcal{H}$, the graph parameters elimination distance to $\mathcal{H}$ (denoted by ${\mathbf{ed}}_{\mathcal{H}}$) [Bulian and Dawar, Algorithmica, 2016], and $\mathcal{H}$-treewi…