The complexity of the vertex-minor problem

Axel Dahlberg, Jonas Helsen, Stephanie Wehner

A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subje…