The complexity of the vertex-minor problem
Axel Dahlberg (TU Delft - QuTech Advanced Research Centre, TU Delft - QID/Wehner Group)
Jonas Helsen (TU Delft - QuTech Advanced Research Centre, TU Delft - Quantum Information and Software)
S.D.C. Wehner (TU Delft - QuTech Advanced Research Centre, TU Delft - Quantum Internet Division, TU Delft - Quantum Information and Software)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
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 subject of intense study in graph theory over the last decades and have found applications in other fields such as quantum information theory. Therefore it is natural to consider the computational complexity of deciding whether a given graph G has a vertex-minor isomorphic to another graph H. Here we prove that this decision problem is NP-complete, even when restricting H and G to be circle graphs, a class of graphs that has a natural relation to vertex-minors.
help_outline