Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
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… Expand
  • 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… Expand
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
  • V. Choi
  • Quantum Inf. Process.
  • 2011
  • Corpus ID: 1308526
In Choi (Quantum Inf Process, 7:193–209, 2008), we introduced the notion of minor-embedding in adiabatic quantum optimization. A… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Testing a property P of graphs in the bounded degree model deals with the following problem: given a graph G of bounded degree d… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
  • Sang-il Oum
  • J. Comb. Theory, Ser. B
  • 2005
  • Corpus ID: 18732580
The rank-width is a graph parameter related in terms of fixed functions to clique-width but more tractable. Clique-width has nice… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Regulation by the state can take a variety of forms. Some regulations are aimed entirely at redistribution, such as when we tax… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Recent results on graph minors make it desirable to have efficient algorithms, that for a fixed set of graphs {H1, ..., H c… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
  • B. Courcelle
  • RAIRO Theor. Informatics Appl.
  • 1992
  • Corpus ID: 19292236
On etudie les liens entre les decompositions arborescentes d'hypergraphes introduites par Robertson et Seymour et les expressions… Expand
  • figure 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Researchers and Kids Participant Observation with Preschoolers Participant Observation with Preadolescents Participant… Expand
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… Expand
Is this relevant?