A splitter theorem on 3-connected binary matroids and inner fans
From MaRDI portal
Cites work
- A splitter theorem on 3-connected matroids
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Contractible edges in 3-connected graphs that preserve a minor
- Contractible edges in triangle-free graphs
- Decomposition of regular matroids
- scientific article; zbMATH DE number 5047784 (Why is no real title available?)
- Longest cycles in 3-connected graphs contain three contractible edges
- On 3-connected minors of 3-connected matroids and graphs
- On contractible and vertically contractible elements in 3-connected matroids and graphs
- On matroid connectivity
- On the structure of 3-connected matroids and graphs
- Some Results Concerning the Structure of Graphs
- Stabilizers of classes of representable matroids
This page was built for publication: A splitter theorem on 3-connected binary matroids and inner fans
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987040)