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