On minor-minimally 3-connected binary matroids
From MaRDI portal
Recommendations
Cites work
Cited in
(14)- scientific article; zbMATH DE number 952957 (Why is no real title available?)
- Partial matroid representations
- On minimally 3-connected binary matroids
- The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor.
- A minor-based characterization of matroid 3-connectivity
- On the 3-connected matroids that are minimal having a fixed spanning restriction
- A chain theorem for \(3^+\)-connected graphs
- On 3-connected minors of 3-connected matroids and graphs
- \(N\)-critical matroids
- On minor-minimally-connected matroids
- Minimally 3-connected binary matroids
- On chains of 3-connected matroids
- A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
This page was built for publication: On minor-minimally 3-connected binary matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025948)