Unavoidable parallel minors of regular matroids
From MaRDI portal
Publication:2275466
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Decomposition of regular matroids
- Modular Constructions for Combinatorial Geometries
- On Nonbinary 3-Connected Matroids
- Typical subgraphs of 3- and 4-connected graphs
- Unavoidable minors of large 3-connected binary matroids
- Unavoidable minors of large 3-connected matroids
- Unavoidable parallel minors of 4-connected graphs
Cited in
(8)- Dominating circuits in regular matroids
- Unavoidable parallel minors of 4-connected graphs
- Strong splitter theorem
- On maximum-sized \(k\)-regular matroids
- Unavoidable connected matroids retaining a specified minor
- On the number of circuits in regular matroids (with connections to lattices and codes)
- Quasiregular matroids
- The regular matroids with no 5-wheel minor
This page was built for publication: Unavoidable parallel minors of regular matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275466)