Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,180,430 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Algebraic matroid
Bicircular matroid
Binary matroid
Branch-decomposition
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An infinite family of excluded minors for strong base-orderability
Joseph E. Bonin
,
Thomas J. Savitsky
2015
Corpus ID: 119161534
2014
2014
Asymptotic Properties of Some Minor-Closed Classes of Graphs
M. Bousquet-Mélou
,
Kerstin Weller
Combinatorics, probability & computing
2014
Corpus ID: 15477677
Let ${\cal A}$ be a minor-closed class of labelled graphs, and let ${\cal G}_{n}$ be a random graph sampled uniformly from the…
Expand
2014
2014
When does a biased graph come from a group labelling?
Matt DeVos
,
Daryl Funk
,
Irene Pivotto
Advances in Applied Mathematics
2014
Corpus ID: 37684602
2014
2014
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Jannis Bulian
,
A. Dawar
Algorithmica
2014
Corpus ID: 13133441
A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al., Parameterized and…
Expand
2011
2011
Characterization of graphs and digraphs with small process numbers
D. Coudert
,
Jean-Sébastien Sereni
Discrete Applied Mathematics
2011
Corpus ID: 9712372
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
2010
2010
Growth constants of minor-closed classes of graphs
O. Bernardi
,
M. Noy
,
D. Welsh
Journal of combinatorial theory. Series B (Print)
2010
Corpus ID: 12672576
Review
2009
Review
2009
Surveys in Combinatorics 2009: Counting planar graphs and related families of graphs
Omer Giménez
,
M. Noy
2009
Corpus ID: 15116428
In this article we survey recent results on the asymptotic enumeration of planar graphs and, more generally, graphs embeddable in…
Expand
Highly Cited
2009
Highly Cited
2009
Characterisations and examples of graph classes with bounded expansion
J. Nesetril
,
P. D. Mendez
,
D. Wood
European journal of combinatorics (Print)
2009
Corpus ID: 2633083
Highly Cited
2008
Highly Cited
2008
Computing excluded minors
Isolde Adler
,
Martin Grohe
,
S. Kreutzer
ACM-SIAM Symposium on Discrete Algorithms
2008
Corpus ID: 5541224
By Robertson and Seymour's graph minor theorem, every minor ideal can be characterised by a finite family of excluded minors. (A…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE