Unavoidable parallel minors of regular matroids
From MaRDI portal
Publication:2275466
DOI10.1016/J.EJC.2011.02.008zbMATH Open1229.05062OpenAlexW2169261093MaRDI QIDQ2275466FDOQ2275466
Authors: Carolyn Chun, James Oxley 
Publication date: 9 August 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.02.008
Recommendations
Cites Work
- Decomposition of regular matroids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Typical subgraphs of 3- and 4-connected graphs
- Title not available (Why is that?)
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Modular Constructions for Combinatorial Geometries
- Unavoidable minors of large 3-connected matroids
- Unavoidable minors of large 3-connected binary matroids
- On Nonbinary 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)
