### Paloma T. Lima, Graph Square Roots of Small Distance from Degree One Graphs

### Paloma T. Lima, Graph Square Roots of Small Distance from Degree One Graphs

Given a graph class $\mathcal{H}$, the task of the $\mathcal{H}$-Square Root problem is to decide whether an input graph G has a square root H that belongs to $\mathcal{H}$. We are interested in the parameterized complexity of the problem for classes $\mathcal{H}$ that are composed by the graphs at vertex deletion distance at most $k$ …