The complexity of the vertex-minor problem

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, which was previously unknown. Here we prove that this decision problem is NP-complete, even when restricting H, G to be circle graphs, a class of graphs that has a natural relation to vertex-minors.


Introduction
A central problem in graph theory is the study of 'substructures' of graphs. These substructures of some graph G are usually defined as the graphs which can be reached, from G, by a given set of graph operations. An example of such a substructure to be seriously studied early on, was the graph minor, where the central question was to decide whether a graph G can be transformed into a graph H through the successive application on G of vertex deletions, edge deletions and edge contractions [1]. If this is the case we call H a minor of G. The problem (M IN OR) of deciding whether a graph H is a minor of G is NP-complete when both H and G are part of the input to the problem [2]. However, given a fixed H, we can define the problem (H − M IN OR) of deciding whether H is a minor of G, where only G is part of the input. As expounded in Robertson & Seymour's seminal series of papers [3], H − M IN OR is solvable in cubic time for any graph H. Since then a great variety of minor-relations has been defined and for many of those the complexity has been studied. Of particular interest recently are the minor-relations related to the graph operation of local complementation, namely vertex-and pivot-minors. These two minor structures have been studied within the graph theory community [4,5,6,7] but have also found surprising applications outside of it, notably in the field of quantum information science [8,9,10,11,12,13]. The complexity of the vertex-and pivot-minor decision problems was a notable open problem (see question 7 in [14]). Recently it was proven in [15] that the pivot-minor problem is NP-complete if both G and H are part of the input to the problem, but the complexity of the vertex-minor problem was left open. In [16] we proved, in the context of quantum information theory, the NP-completeness of the labeled version of the vertex-minor problem, i.e. the problem of deciding if H is a vertex-minor of the graph G, taking labeling into account. The labeled version of the vertex-minor problem is relevant in the context of quantum information theory since there the vertices of the graph corresponds to physical qubits in, for example, a quantum network. However we did not discuss the complexity of the related problem of deciding whether G has a vertex-minor isomorphic to H (on any subset of the vertices). Here we close this gap, proving that the unlabeled version of the vertex-minor problem is also NP-complete. To avoid confusion with the problems studied in [16] we will here call the unlabeled version of the vertex-minor problem ISO -VERTEXMINOR. Moreover we here prove that ISO -VERTEXMINOR remains NP-complete even when H is restricted to be a star graph and G a circle graph. Our work resolves the problem left open in [15] and provides a partial answer to the questions posed in [14]. In the process of proving hardness we make use of the concept of the semi-ordered Eulerian tour (Soet), a graph construction we introduced in [16] that may be of further independent interest.
The paper is organized as follows: in section 2 we recall relevant graph theoretic notions such as vertex-minors and circle graphs. We also discuss the concept of semi-ordered Eulerian tours. In section 3 we prove the main result: the NP-completeness of the vertex-minor problem.

Preliminaries
In this section we review relevant graph theoretical notions. We begin by treating the local complementation operation and the notion of vertex-minors before discussing a class of graphs called circle graphs. Here we also introduce the notion of a semi-ordered Eulerian tour and connect it to the existence of star-graph vertex-minors of circle graphs.
We will denote graphs by capital letters: G, H, F, R, ... Graphs are assumed to be simple unless otherwise indicated. The vertex-set of a graph G is denoted V (G) and the edge-set is denoted E(G). Give a vertex v in a graph G we call denote the neighborhood of v (the set of vertices adjacent to v in G) by N v . Given a graph G and a subset of its vertices V we will denote the induced subgraph of G on those vertices by G[V ]. We denote the fully connected graph on n vertices as K n .
We denote words, i.e. ordered sequences of elements of a set (with repetition) by boldface letters, i.e. X, Y , Z, .... We denote the mirroring (reversing of the ordering of its letters) of a word X by X. Throughout this paper we use the following notation for sets of consecutive natural numbers

Vertex-minors
We review the definition of local complementation: Definition 2.1 (Local complementation). A local complementation τ v is a graph operation specified by a vertex v, taking a graph G to τ v (G) by replacing the induced subgraph on the neighborhood of v, i.e. G[N v ], by its complement. The neighborhood of any vertex u in the graph τ v (G) is therefore given by where ∆ denotes the symmetric difference between two sets.
Given a sequence of vertices v = v 1 . . . v k , we denote the induced sequence of local complementations, acting on a graph G, as A graph H that can be reached from another graph G using local complementations and vertexdeletions is called a vertex-minor [4] and is formally defined as: Associated to the notion of vertex-minor is the natural decision problem: . Given a graph G and a graph H decide whether their exists a graphH such that (1) H andH are isomorphic, and (2)H < G.
We can restrict this problem to a special case, where the graph H is a star-graph on k vertices. We call this problem ISO -STARVERTEXMINOR. Note that we must only specify k as there exists only one star-graph on k vertices up to isomorphism. Formally we have Problem 2.2 (ISO -STARVERTEXMINOR). Given a graph G and an integer k decide whether there exists a subset V of V (G) with |V | = k and a star graph on V denoted S V such that S V < G.

Circle graphs
Here we review circle graphs and representations of these under the action of local complementations. Circle graphs are also sometimes called alternance graphs since they can be described, as explained below, by a double-occurrence word such that the edges of the graph are the given by the alternances induced by this word, . We will make use of this description here, which was introduced by Bouchet in [17] and also described in [18]. This description is also related to yet another way to represent circle graphs, as Eulerian tours of 4-regular multi-graphs, introduced by Kotzig in [19]. For an overview of the theory and history of circle graphs see for example the book by Golumbic [20].

Double-occurrence words
Let us first define double-occurrence words and equivalence classes of these. This will allow us to define circle graphs.

Definition 2.3 (Double occurrence word).
A double-occurrence word X is a word with letters in some set V , such that each element in V occurs exactly twice in X.
Given a double-occurrence word X we will write V (X) = V for its set of letters.
Definition 2.4 (Equivalence class of double-occurrence words). We say that a double-occurrence word Y is equivalent to another X, i.e. Y ∼ X, if Y is equal to X, the mirror X or any cyclic permutation of X or X. We denote by d X = {Y : Y ∼ X} the equivalence class of X, i.e. the set of words equivalent to X.
Next we define alternances of these equivalence classes, which will represent the edges of an alternance graph.
Note that if (u, v) is an alternance of d X then so is (v, u), since the mirror of any word in d X is also in d X .
Definition 2.6 (Alternance graph). The alternance graph A(X) of a double-occurrence word X is a graph with vertices V (X) and edges given exactly by the alternances of d X , i.e.
Note that since A(X) only depends on the equivalence class of X, the alternance graphs A(X) and A(Y ) are equal if X ∼ Y . Now we can formally define circle graphs.
Definition 2.7 (Circle graph). A graph G which is the alternance graph of some double-occurrence word X is called a circle graph.
As an example, consider the following double-occurrence word with letters in the set V 0 = {a, b, c, d, e}: The alternances of d X 0 are thus and their mirrors. The alternance graph A(X 0 ) is therefore the graph in fig. 1. Figure 1: An example of a circle graph induced by the double-occurrence word adcbaebced.

Eulerian tours on 4-regular multi-graphs
There is yet another way to represent circle graphs, closely related to double-occurrence words, namely as Eulerian tours of 4-regular multi-graphs. A 4-regular multi-graph is a graph where each vertex has exactly four incident edges and can contain multiple edges between each pair of vertices or edges only incident to a single vertex.
Definition 2.8 (Eulerian tour). Let F be a connected 4-regular multi-graph. An Eulerian tour U on F is a tour that visits each edge in F exactly once.
Any 4-regular multi-graph is Eulerian, i.e. has a Eulerian tour, since each vertex has even degree [21].
Furthermore, any Eulerian tour on a 4-regular multi-graph F traverses each vertex exactly twice, except for the vertex which is both the start and the end of the tour. Such a Eulerian tour induces therefore a double-occurrence word, the letters of which are the vertices of F , and consequently a circle graph as described in the following definition.
Definition 2.9 (Induced double-occurrence word). Let F be a connected 4-regular multi-graph on k vertices V (F ). Let U be a Eulerian tour on F of the form with x i ∈ V (F ) and e i ∈ E(F ). Note that every element of V occurs exactly twice in U , except x 0 . From a Eulerian tour U as in eq. (9) we define an induced double-occurrence word as To denote the alternance graph given by the double-occurrence word induced by a Eulerian tour, we will write A(U ) ≡ A(m(U )).
Similarly to double-occurrence words, we also introduce equivalence classes of Eulerian tours under cyclic permutation or reversal of the tour.
Definition 2.10 (Equivalence class of Eulerian tours). Let F be a connected 4-regular multi-graph and U be an Eulerian tour on F . We say that an Eulerian tour U on F is equivalent to U , i.e. U ∼ U , if U is equal to U , the reversal U or any cyclic permutation of U or U . We denote by t U the equivalence class of U , i.e. the set of Eulerian tours on F which are equivalent to U .
It is clear that if the Eulerian tours U and U on a 4-regular multi-graph F are equivalent, then so are the double-occurrence words m(U ) and m(U ). Furthermore, as for double-occurrence words, two equivalent Eulerian tours on a connected 4-regular multi-graph induce the same alternance graph.
Consider for example the 4-regular multi-graph in fig. 2(a). This graph has a tour U 0 with an induced double-occurrence word m(U ) = adcbaebced (11) Note, that this is equal to the word in eq. (7) which shows that A(U ) is also the graph in fig. 1.

Vertex-minors of circle graphs
When we are considering vertex-minors of circle graphs, it is useful to map the operations of local complementation and vertex deletion on an alternance graph of a double-occurrence word to operations on that double-occurrence word.
We start by considering local complementation. Let X = AvBvC be a double-occurrence word with alternance graph A(X) and let v be an element in V (X). Local complementation at the vertex v in the graph A(X) now corresponds to the mirroring of the sub-word B of X in between the two occurrences of v, i.e.
Note that both the double-occurrence word X = AvBvC and the double-occurrence word Av BvC arise as words induced by Eulerian tours on the same 4-regular graph F . One can in fact show [18] that two circle graphs are equivalent under the action of local complementation if and only if they arise as alternance graphs induced by Eulerian tours on the same 4-regular multi-graph.
Next we consider vertex deletion. We will denote by X \ v the deletion of the element v, i.e.
The resulting word ABC is also a double-occurrence word and furthermore we have that If W = {w 1 , w 2 . . . , w l } is a subset of V , we will write X \ W as the deletion of all elements in W , i.e.
Connected to this we can also define an induced double-occurrence sub-word The reason for calling this an induced double-occurrence sub-word stems from its relation to induced subgraphs of the alternance graph as We can decide if a circle graph has a certain vertex-minor by considering Eulerian tours of a 4regular graph, which is captured in the following theorem, a proof of which can be found in [16]. This theorem states that vertex-minors of alternance graphs induced by a Eulerian tour on a 4regular graph F are exactly the alternance graphs induced by sub-words formed by Eulerian tours on F .
Theorem 2.1. Let F be a connected 4-regular multi-graph and let G be a circle graph such that G = A(U ) for some Eulerian tour U on F . Then G is a vertex-minor of G if and only if there exist a Eulerian tour U on F such that

Semi-Ordered Eulerian tours
From the previous sections we have seen that circle graphs and their vertex-minors can be described by Eulerian tours on connected 4-regular multi-graphs. One can thus ask, given a graph H, what properties a 4-regular multi-graph F must possess such that any of its alternance graphs 1 has H as a vertex-minor. We answered this question in [8] for the case when H is a star graph by introducing the notion of a Semi-ordered Eulerian Tour (Soet), defined as Note that the multi-graph F is not assumed to be simple, so multi-edges and self-loops are allowed. A Soet is a Eulerian tour on F that traverses the elements of V in some order once and then again in the same order. The particular order in which the Soet traverses V will not be important here, only that it traverses V in the same order twice. As an example, the graph in fig. 2(a) allows for a Soet with respect to the set {a, b, c, d} but the graph in fig. 2(b) does not. The following theorem, a trivial corollary of Corollary 2.6.1 in [8], connects the problem of finding star graphs as vertex-minors of circle graphs to the problem of finding Soets on 4-regular multigraphs.
Theorem 2.2. Let F be a connected 4-regular multi-graph and let G be a circle graph given by the alternance graph of a Eulerian tour U on F , i.e. G = A(U ). Furthermore let S V be a star graph on the vertices V . Then S V < G if and only if F allows for a Soet (see definition 2.11) with respect to V .
This gives rise to a natural decision problem which we denote ISO -SOET:

Problem 2.3 (ISO -SOET).
Let F be a 4-regular multi-graph and let k ≤ |V (F )| be an integer. Decide whether there is a V ⊂ V (F ) with |V | = k such that there exists a Soet U on F with respect to the set V .
In [16] we proved that a version of problem 2.3 where V is part of the input to the problem, is NP-complete. In the next section we prove that also the problem of deciding whether such a V exists, i.e. problem 2.3, is also NP-complete.
One can see that a Soet on a 4-regular multi-graph F with respect to V , imparts an ordering on the subset of vertices V . We will in particular be interested in vertices in V that are 'consecutive' with respect to the Soet. Consecutiveness is defined as follows.
Definition 2.12 (Consecutive vertices). Let F be a 4-regular graph and U a Soet on F with respect to a subset V ⊆ V (F ). Two vertices u, v ∈ V are called consecutive in U if there exist a sub-word uXv or vXu of m(U ) such that no letter of X is in V .
We also define the notion of a "maximal sub-word" associated with two consecutive vertices. For i ∈ [k], we call X i and Y i the two maximal sub-words associated with the consecutive vertices s i and s (i+1 (mod k)) .
Given two consecutive vertices u and v, we will denote their two maximal sub-words as X and X , Y and Y or similar.

NP-completeness of the vertex-minor problem
In this section we prove the NP-completeness of the vertex-minor problem. This we do in three steps. We will begin by (1) proving that ISO -SOET is NP-Hard. We do this by reducing the problem of deciding whether a 3-regular graph R is Hamiltonian to ISO -SOET. Next we (2) reduce ISO -SOET to ISO -STARVERTEXMINOR and ISO -STARVERTEXMINOR to ISO -VERTEXMINOR, thus proving the NP-hardness of ISO -VERTEXMINOR. Finally we (3) show that ISO -VERTEXMINOR is also in NP.

SOET is NP-hard
We first review the definition of a Hamiltonian graph and the associated CUBHAM decision problem.

Definition 3.1 (Hamiltonian). A graph is said to be Hamiltonian if it contains a Hamiltonian cycle. A Hamiltonian cycle is a cycle that visits each vertex in the graph exactly once.
Problem 3.1 (CUBHAM). Let R be a 3-regular graph. Decide whether R is Hamiltonian.
The reduction of CUBHAM to ISO -SOET is done by going though the following steps.
1. Introduce the notion of a (4-regular) K 3 -expansion Λ(R) of a 3-regular graph R. This is done in definition 3.2.
2. Prove that if a 3-regular graph R is Hamiltonian then the K 3 -expansion Λ(R) of R allows for a Soet of size 2|V (R)|. This is done in lemma 3.1 3. Prove that if the K 3 -expansion Λ(R) of a 3-regular graph R allows for a Soet of size 2|V (R)| then R is Hamiltonian. This is done in lemma 3.3 Note that 1. and 2. above provides necessary and sufficient condition for whether a 3-regular graph R is Hamiltonian in terms of whether Λ(R) allows for a Soet of a certain size. This implies that CUBHAM reduces to ISO -SOET and hence that ISO -SOET is NP-hard.
We begin by introducing the K 3 -expansion: a mapping from 3-regular graphs to 4-regular multigraphs.
Definition 3.2 (K 3 -expansion). Let R be a 3-regular graph. A K 3 -expansion Λ(R) of a 3-regular graph R is constructed from R by performing the following two steps: 1. Replace each vertex v in R with a subgraph isomorphic to K 3 as below =⇒ (18) where x, y and z are the neighbors of v. We will denote the K 3 -subgraph associated to the

For all
The graph Λ(R) will be called a K 3 -expansion of R. A multi-graph F that is the K 3 -expansion of some 3-regular graph R will also be referred to as a K 3 -expanded graph. Furthermore, the number of vertices in Λ(R) is 3 · |V (R)| and the number of edges is 2 · |E(R)| + 3 · |V (R)|. In fig. 3 we show an example of a 3-regular graph and its K 3 -expansion. We now argue that if a 3-regular graph R is Hamiltonian then its K 3 -expansion allows for a Soet on 2|V (R)| vertices and thus providing a necessary condition for a 3-regular graph being Hamiltonian.
Lemma 3.1. Let R be a triangular graph with k vertices and let Λ(R) be its K 3 -expansion. If R is Hamiltonian then Λ(R) allows for a Soet of size 2k.
Proof. Let M be a Hamiltonian tour on R. Choose x 0 ∈ V (R) and let L = x 0 x 1 · · · x k−1 be the word formed by walking along M when starting on x 0 . Note that x i , x (i+1 (mod k)) are adjacent in R for all i ∈ [k]. Now consider the K 3 -expansion Λ(R) of R. We will argue that Λ(R) allows for a Soet with respect to the set V = {x let v i be the unique vertex adjacent to x i in Λ(R) that is not x (i−1 (mod k)) or x (i+1 (mod k)) . Now consider the following words on V (Λ(R)).
These words describe disjoint trails on Λ(R) as illustrated for an example graph in fig. 4.  ) and (20) on the associated K 3 -expansion Λ(K V ). The edges used to extend the tour to a Eulerian tour as captured by algorithm 1 are show as green dotted arrows. Now consider the word VW. This word describes a trail U V W on Λ(R) that visits every vertex in V exactly twice in the same order. This means U V W is a semi-ordered tour. It is however not Eulerian. To make it Eulerian we have to extend the tour U V W to include all edges in Λ(R). Note that these edges are precisely the edges connecting the vertices x . We can lift U V W to a Eulerian tour by adding vertices to W by the following algorithm. It is easy to see Algorithm 1 Algorithm for lifting the tour U V W to a Eulerian tour on Λ(R) end if end for that the tour described by VW after running algorithm 1 is also Eulerian and is hence a Soet with respect to the set V . This completes the lemma.
Next we prove a necessary condition (lemma 3.3) for the existence of a Soet on a subset V of the vertices of a 4-regular graph F . Lemma 3.2. Let F be a 4 regular graph and V ≥ 4 be a subset of its vertices. If the fully connected graph K 3 is an induced subgraph of F [V ] then F does not allow for a Soet with respect to V Proof. Assume that F has three vertices V = {u, v, w} such that F [V ] = K 3 . Let U be a Eulerian tour on F (note that U always exists). Assume by contradiction that U is a Soet with respect to V . It is easy to see that since u and v are adjacent in F they must also be consecutive in U . However the same is true for u and w and also w and v. This means a tour starting at u and must traverse v, then w, and then immediately u again (up to interchanging u and w). Since {u, v, w} is a strict subset of V (since by assumption |V | ≥ 4) this means that, when starting at u, the tour U does not traverse all vertices in V before returning to u. This gives a contradiction with the definition of Soet from which the lemma follows. Now we will leverage lemma 3.2 to prove that if the K 3 -expansion Λ(R) of a 3-regular graph R allows for a Soet with respect to a vertex-set V with |V | = 2|V (R)| then the graph R must be Hamiltonian. Lemma 3.3. Let R be a 3-regular graph and Λ(R) its K 3 -expansion. If there exists a set V ⊂ V (Λ(R)) with |V | = 2|V (R)| such that Λ(R) allows for a Soet with respect to V then R must be Hamiltonian.
Proof. Assume that there exists a subset V of V (Λ(R)) with |V | = 2|V (R)| such that Λ(R) allows for a Soet U with respect to V .
Note first that since |V (Λ)| = 3|V (R)| and |V | = 2|V (R)| we must have, by lemma 3.2 that |V [T u ] ∩ V | = 2 for all u ∈ V (R). This is easiest seen by contradiction. Assume that there exists a u ∈ V (R) such that |V (Λ)| = 3|V (R)|, and |V | = 2|V (R)| this implies there must also a exist a u ∈ V (R) such that |V (T u ) ∩ V | = 3. This means that V (T u ) ⊂ V . However the induced subgraph Λ(R)[T u ] is isomorphic to K 3 (this is easily seen from the definition of K 3 -expansion). By lemma 3.2 we must thus conclude that Λ(R) does not allow for a Soet with respect to V leading to a contradiction. Hence we must have that |V (T u ) ∩ V | = 2 for all u ∈ V (R). Now consider two vertices x, x ∈ V such that x, x are consecutive in the Soet U . Note that, by definition of Λ(R), there must exist w, w ∈ V (R) such that x ∈ T w and x ∈ T w . We will now argue that we must have either w = w or w, w are adjacent in R. We argue this by contradiction. Assume thus that w, w are neither equal nor adjacent in R. Now consider the maximal sub-word Y of m(U ) associated to x, x . Since w, w are neither equal nor adjacent in R, the trail described by the word Y must pass through a triangle subgraph different from T w and T w , i.e. there exist a vertex w ∈ V (R) such that |Y ∩ V (T w )| ≥ 2. However since by construction |V (T w ) ∩ V | = 2 (as shown above) and |V (T w )| = 3 we must have that |V ∩ Y| ≥ 1. This is however in contradiction with the maximality of the sub-word Y. Hence we must have that w = w or that (w, w ) ∈ E(R). Now consider the word m(U ) associated to the Soet U and the induced sub-word m(U )[V ]. By the above, and the fact that if two vertices in V are adjacent in Λ(R), they must also be consecutive in U (this is a consequence of U being Eulerian and thus having to traverse the edge connecting these vertices), we have that m(U )[V ] must be of the form where x i , x i ∈ T w i and {w 1 , . . . w k } = V (R) and moreover that ( and also (w k , w 0 ) ∈ E(R). This immediately implies that the word M = w 1 w 2 . . . w k describes a Hamiltonian tour on R, and hence that R is Hamiltonian.
Since lemma 3.3 and lemma 3.1 provide necessary and sufficient conditions for a 3-regular graph being Hamiltonian in terms of whether a K 3 -expanded graph allows for a Soet, we can now easily prove the hardness of problem 2.3.
Proof. Let R be an instance of CUBHAM, that is, a 3-regular graph on k vertices. From R we can construct the 4-regular K 3 -expansion Λ(R). Note that this can be done in poly-time in k. Now note that (Λ(R), 2k) is an instance of ISO -SOET. If R is a YES instance of CUBHAM, that is, R is Hamiltonian, then by lemma 3.1 we have that (Λ(R), 2k) is a YES instance of ISO -SOET.
On the other hand, if (Λ(R), 2k) is a YES instance of ISO -SOET, then R is a YES instance of CUBHAM by lemma 3.3. By contra-position this means that if R is a NO instance of CUBHAM, then (Λ(R), 2k) is a NO instance of ISO -SOET. This means CUBHAM is Karp-reducible to Soet. Since CUBHAM is NP-complete [22], this implies that Soet is NP-hard.

ISO-VERTEXMINOR is NP-Hard
Note first that ISO -STARVERTEXMINOR trivially reduces to ISO -VERTEXMINOR, as it is a strict sub-problem. This means that if ISO -STARVERTEXMINOR is NP-hard then so is ISO -VERTEXMINOR. In this section we show that the ISO -SOET reduces to ISO -VERTEXMINOR. For this we will make use of the properties of circle graphs, discussed in section 2.
Theorem 2.2 states that a 4-regular multi-graph F allows for a Soet with respect to a subset of its vertices V ⊆ V (F ) if and only if an alternance graph A(U ) (which is a circle graph), induced by some Eulerian tour on F , has a star graph S V on V as a vertex-minor.
Since circle graphs are a subset of all simple graphs we can then decide whether a 4-regular graph F allows for a Soet with respect to some subset V of its vertices by constructing the circle graph induced by an Eulerian tour on F and checking whether it has a star-vertex-minor on the vertex set V . This leads to the following theorem. Proof. Let (F, k) be an instance of ISO -SOET, where F is a 4-regular multi-graph and k ≤ |V (F )| some integer. Also let G be a circle graph induced by some Eulerian tour U on F . From theorem 2.2 we see that G has S V as a vertex-minor for some subset of vertices V of G if and only if F allows for a Soet with respect to this vertex set V . Since an Eulerian tour U can be found in polynomial time [23] and since G can be efficiently constructed given U [16], considering the case of |V | = k concludes the reduction.

ISO-VERTEXMINOR is in NP
Next we argue that the problem ISO -VERTEXMINOR is in NP. This just follows from the fact that the non-isomorphic vertex-minor problem is in NP.
Theorem 3.3. The decision problem ISO -VERTEXMINOR is in NP.
Proof. From [16] we know that there exists a polynomial-length witness for the problem of deciding if a labeled graph G has a vertex-minor equal to another graph H on some fixed subset of its vertices. Since GRAPHISOMORPHISM is in NP we can construct a polynomial-length for ISO -VERTEXMINOR, i.e. to decide if G has a vertex-minor isomorphic to H. We thus conclude that ISO -VERTEXMINOR is in NP.