The structure of a 3-connected matroid with a 3-separating set of essential elements
From MaRDI portal
Recommendations
Cited in
(15)- Matroids and graphs with few non-essential elements
- On the structure of 3-connected matroids and graphs
- Elements belonging to triads in 3-connected matroids
- Fork-decompositions of matroids
- \(N\)-detachable pairs in 3-connected matroids. I: Unveiling \(X\)
- The structure of equivalent 3-separations in a 3-connected matroid
- Strong splitter theorem
- An upgraded Wheels-and-Whirls theorem for 3-connected matroids
- A splitter theorem for elastic elements in 3-connected matroids
- Cographic splitting of graphic matroids using a set with three elements
- What is a 4-connected matroid?
- The structure of the 3-separations of 3-connected matroids
- A chain theorem for 4-connected matroids
- Exposing 3-separations in 3-connected matroids
- The structure of 3-connected matroids of path width three
This page was built for publication: The structure of a 3-connected matroid with a 3-separating set of essential elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874361)