A minimal 3-connectedness result for matroids
From MaRDI portal
Publication:1195474
DOI10.1016/0012-365X(92)90315-7zbMath0768.05020OpenAlexW1979204580MaRDI QIDQ1195474
Publication date: 6 December 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90315-7
Related Items (max. 100)
Some Local Extremal Connectivity Results for Matroids ⋮ Some extremal connectivity results for matroids ⋮ On the structure of 3-connected matroids and graphs ⋮ On extremal connectivity properties of unavoidable matroids ⋮ Matroid packing and covering with circuits through an element
Cites Work
- Unnamed Item
- Unnamed Item
- Adjoints of binary matroids
- On 3-connected matroids
- Packing and covering with matroid circuits
- A simple theorem on 3-connectivity
- Some extremal connectivity results for matroids
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Matroids with Sylvester property
- ON MATROID CONNECTIVITY
- On Connectivity in Matroids and Graphs
- On 3-Connected Matroids
- Connectivity in Matroids
This page was built for publication: A minimal 3-connectedness result for matroids
