Families of matroids induced by classes of graphs
It is easily proved that, if <em>P</em> is a class of graphs that is closed under induced subgraphs, then the family of matroids whose basis graphs belong to <em>P</em> is closed under minors. We give simple necessary and sufficient conditions for a minor-closed class of matr...
Main Author: | Mayhew, D |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2005
|
Subjects: |
Similar Items
-
Matroids and complexity
by: Mayhew, D
Published: (2005) -
On the representability of the biuniform matroid
by: Ball, Simeon, et al.
Published: (2014) -
The homotopy type of the matroid Grassmannian
by: Biss, Daniel Kálmán, 1977-
Published: (2005) -
Hepp’s bound for Feynman graphs and matroids
by: Panzer, E
Published: (2022) -
Enumerative and algebraic aspects of matroids and hyperplane arrangements
by: Ardila, Federico, 1977-
Published: (2005)