On chains of 3-connected matroids
From MaRDI portal
Publication:1086571
DOI10.1016/0166-218X(86)90039-9zbMATH Open0609.05024OpenAlexW1972502774MaRDI QIDQ1086571FDOQ1086571
Authors: Robert E. Bixby, Collette R. Coullard
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(86)90039-9
Recommendations
Cites Work
- Decomposition of regular matroids
- Title not available (Why is that?)
- A Combinatorial Decomposition Theory
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Menger's theorem for matroids
- A characterization of 3-connected graphs containing a given graph
- On matroid connectivity
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
- Title not available (Why is that?)
- Partial matroid representations
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
- Title not available (Why is that?)
- 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)