# Graph minor

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- ArXiv
- 2014

We present a heuristic algorithm for finding a graph H as a minor of a graph G that is practical for sparse G and H with hundredsâ€¦Â (More)

Is this relevant?

Highly Cited

2014

Highly Cited

2014

- J. ACM
- 2014

One of the key results in Robertson and Seymourâ€™s seminal work on graph minors is the grid-minor theorem (also called the <iâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Quantum Information Processing
- 2011

In [6], we introduced the notion of minor-embedding in adiabatic quantum optimization. A minor-embedding of a graph G in aâ€¦Â (More)

Is this relevant?

2011

2011

- IEEE 52nd Annual Symposium on Foundations ofâ€¦
- 2011

We generalize the seminal Graph Minor algorithm of Robertson and Seymour to the parity version. We give polynomial timeâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 46th Annual IEEE Symposium on Foundations ofâ€¦
- 2005

At the core of the seminal graph minor theory of Robertson and Seymour is a powerful structural theorem capturing the structureâ€¦Â (More)

Is this relevant?

2005

2005

- Discrete Applied Mathematics
- 2005

In their work on graph minors, Robertson and Seymour begin by describing graphs whose structure is particularly simple, graphsâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- J. Comb. Theory, Ser. B
- 2005

The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has niceâ€¦Â (More)

Is this relevant?

2000

2000

- Theor. Comput. Sci.
- 2000

The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural graph properties areâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- ITA
- 1992

We relate the tree-decompositions of hypergraphs introduced by Robertson and Seymour to the finite and infinitĂ© algebraicâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- J. Comb. Theory, Ser. B
- 1986

We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructedâ€¦Â (More)

Is this relevant?