On 3-connected es-splitting binary matroids
From MaRDI portal
Recommendations
Cites work
- A characterization of n-connected splitting matroids
- A characterization of the bases of line-splitting matroids
- A classification of 4-connected graphs
- A forbidden-minor characterization for the class of regular matroids which yield the cographic es-splitting matroids
- Extension of line-splitting operation from graphs to binary matroids
Cited in
(7)- A splitter theorem on 3-connected matroids
- A characterization of cocircuits of an es-splitting matroid
- On the structure of spikes
- On \(n\)-connected minors of the \(es\)-splitting binary matroids
- The closure operator, flats and hyperplanes of es-splitting matroid
- Cographic splitting of graphic matroids using a set with three elements
- The \(es\)-splitting operation for matroids representable over prime fields \(\mathrm{GF}(p)\)
This page was built for publication: On 3-connected es-splitting binary matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806099)