Graph minor

Known as: Minor-closed graph family, Minor (graph), Topological minor 
In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2014
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In [6], we introduced the notion of minor-embedding in adiabatic quantum optimization. A minor-embedding of a graph G in a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
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
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
In their work on graph minors, Robertson and Seymour begin by describing graphs whose structure is particularly simple, graphs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice… (More)
  • figure 1
  • figure 2
Is this relevant?
2000
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
We relate the tree-decompositions of hypergraphs introduced by Robertson and Seymour to the finite and infinité algebraic… (More)
  • figure 1
Is this relevant?
Highly Cited
1986
Highly Cited
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?