An upgraded Wheels-and-Whirls theorem for 3-connected matroids
From MaRDI portal
(Redirected from Publication:414635)
Recommendations
Cites work
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A Splitter Theorem for Internally 4‐Connected Binary Matroids
- A chain theorem for 4-connected matroids
- A chain theorem for internally 4-connected binary matroids
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Decomposition of regular matroids
- Exposing 3-separations in 3-connected matroids
- Fork-decompositions of matroids
- Generating an internally 4-connected binary matroid from another
- Generating weakly 4-connected matroids
- Inequivalent representations of matroids over prime fields
- Matroid 4-connectivity: A deletion-contraction theorem
- On inequivalent representations of matroids over finite fields
- On the Uniqueness of Matroid Representations Over GF(4)
- On the structure of 3-connected matroids and graphs
- The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
- The structure of 3-connected matroids of path width three
- The structure of the 3-separations of 3-connected matroids
- The structure of the 3-separations of 3-connected matroids. II.
- Towards a splitter theorem for internally 4-connected binary matroids
- Wild triangles in 3-connected matroids
Cited in
(18)- A wheels-and-whirls theorem for 3-connected 2-polymatroids
- Exposing 3-separations in 3-connected matroids
- The structure of the 4-separations in 4-connected matroids
- Strong splitter theorem
- An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
- Extensions of Tutte's wheels-and-whirls theorem
- On 3-connected matroids
- The structure of a 3-connected matroid with a 3-separating set of essential elements
- Matroid 4-connectivity: A deletion-contraction theorem
- Generating weakly 4-connected matroids
- \(N\)-detachable pairs in 3-connected matroids. I: Unveiling \(X\)
- A splitter theorem for elastic elements in 3-connected matroids
- Inequivalent representations of matroids over prime fields
- Improving a chain theorem for triangle-free 3-connected matroids
- The number of elements belonging to triads in 3-connected binary matroids
- Wheels and whirls
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
- Matroid 3-connectivity and branch width
This page was built for publication: An upgraded Wheels-and-Whirls theorem for 3-connected matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414635)