# The complexity of the vertex-minor problem.

@article{Dahlberg2019TheCO, title={The complexity of the vertex-minor problem.}, author={Axel Dahlberg and Jonas Helsen and Stephanie Wehner}, journal={arXiv: Combinatorics}, year={2019} }

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… CONTINUE READING

1

Twitter Mention

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## Transforming graph states to Bell-pairs is NP-Complete

VIEW 12 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 24 REFERENCES

## Reducibility Among Combinatorial Problems

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Computing Small Pivot-Minors

VIEW 2 EXCERPTS

## Quantum network routing and local complementation

VIEW 1 EXCERPT

## Rank-width: Algorithmic and structural results

VIEW 2 EXCERPTS

## Graph minors. I - XXIII

VIEW 1 EXCERPT