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

Matroid minor

In the mathematical theory of matroids, a minor of a matroid M is another matroid N that is obtained from M by a sequence of restriction and… Expand
Wikipedia

Related topics

Related topics

33 relations
Algebraic matroidBicircular matroidBinary matroidBranch-decomposition
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Layered separators in minor-closed graph classes with applications
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is… Expand
  • figure 1
  • figure 2
2011
2011
Characterization of graphs and digraphs with small process numbers
In an objective lens driving unit, an objective lens (12) is fixed to a coil bobbin (11), which has a focus drive coil (13a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2011
2011
The excluded minors for near-regular matroids
In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor isomorphic to U"2","5, U"3","5… Expand
  • table 1
  • figure 1
  • figure 2
2010
2010
Growth constants of minor-closed classes of graphs
A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2010
Highly Cited
2010
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
  • Martin Grohe
  • 25th Annual IEEE Symposium on Logic in Computer…
  • 2010
    • Corpus ID: 7381562
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is… Expand
  • figure 1.1
  • figure 1.2
  • figure 2.1
  • figure 2.2
  • figure 3.1
2009
2009
Random Graphs from a Minor-Closed Class
  • C. McDiarmid
  • Combinatorics, Probability and Computing
  • 2009
    • Corpus ID: 42692951
A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see that such a class of labelled graphs has… Expand
Highly Cited
2008
Highly Cited
2008
Computing excluded minors
By Robertson and Seymour's graph minor theorem, every minor ideal can be characterised by a finite family of excluded minors. (A… Expand
  • figure 2
2007
2007
On the growth rate of minor-closed classes of graphs
A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor… Expand
  • table 1
  • figure 1
  • figure 2
Highly Cited
2005
Highly Cited
2005
Rank-width and vertex-minors
  • 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
1992
1992
The traveling salesman problem in graphs with some excluded minors
Given a graph and a length function defined on its edge-set, the Traveling Salesman Problem can be described as the problem of… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE