Corpus ID: 189762064

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}
}
  • Axel Dahlberg, Jonas Helsen, Stephanie Wehner
  • Published 2019
  • Mathematics, Physics
  • arXiv: Combinatorics
  • 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

    Figures from this paper.

    Citations

    Publications citing this paper.

    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

    Rank-width: Algorithmic and structural results

    • Sang-il Oum
    • Computer Science, Mathematics
    • Discret. Appl. Math.
    • 2017
    VIEW 2 EXCERPTS

    Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width

    VIEW 1 EXCERPT

    Graph States, Pivot Minor, and Universality of (X, Z)-Measurements

    VIEW 1 EXCERPT

    Pivoting makes the ZX-calculus complete for real stabilizers

    VIEW 1 EXCERPT

    Graph minors. I - XXIII

    • Neil Robertson, P D Seymour
    • Journal of Combinatorial Theory, Series B,
    • 2010
    VIEW 1 EXCERPT