On chains of 3-connected matroids
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3598496 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A characterization of 3-connected graphs containing a given graph
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Decomposition of regular matroids
- Menger's theorem for matroids
- On matroid connectivity
- Partial matroid representations
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
Cited in
(10)- On the minor-minimal 3-connected matroids having a fixed minor.
- On the structure of 3-connected matroids and graphs
- Finding a small 3-connected minor maintaining a fixed minor and a fixed element
- On fixing elements in matroid minors
- Extensions of Tutte's wheels-and-whirls theorem
- scientific article; zbMATH DE number 3896952 (Why is no real title available?)
- On triangle-free 3-connected matroids
- On chains of matroids in the weak order
- Improving a chain theorem for triangle-free 3-connected matroids
- \(N\)-critical matroids
This page was built for publication: On chains of 3-connected matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086571)