Extremal critically connected matroids
From MaRDI portal
Cites work
Cited in
(19)- Paths in circuit graphs of matroids
- On Connectivity in Matroids and Graphs
- Elements belonging to triads in 3-connected matroids
- Characterizations of matroids with an element lying in a restricted number of circuits
- Ear‐decompositions, minimally connected matroids and rigid graphs
- On extremal connectivity properties of unavoidable matroids
- The connectivity and minimum degree of circuit graphs of matroids
- On critical circuits in \(k\)-connected matroids
- Cycles in circuit graphs of matroids
- On some extremal connectivity results for graphs and matroids
- Hamilton cycles in circuit graphs of matroids
- Some Local Extremal Connectivity Results for Matroids
- Minimally globally rigid graphs
- Small Cocircuits in Minimally Vertically 4-Connected Matroids
- On packing minors into connected matroids
- Some extremal connectivity results for matroids
- On minor-minimally-connected matroids
- On a matroid generalization of graph connectivity
- On minimally \(k\)-connected matroids
This page was built for publication: Extremal critically connected matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1394352)