The connectivity and minimum degree of circuit graphs of matroids
From MaRDI portal
Publication:5962272
Recommendations
Cites work
- scientific article; zbMATH DE number 3472075 (Why is no real title available?)
- A Fan-In Algorithm for Distributed Sparse Numerical Factorization
- A lower bound on connectivities of matroid base graphs
- Extremal critically connected matroids
- Lower-bounds on the connectivities of a graph
- Paths and cycles in matroid base graphs
- Sufficient conditions for equality of connectivity and minimum degree of a graph
- The connectivity of large digraphs and graphs
- The connectivity of the basis graph of a branching greedoid
Cited in
(12)- Paths in circuit graphs of matroids
- A lower bound on connectivities of matroid base graphs
- Characterizations of matroids with an element lying in a restricted number of circuits
- Ear‐decompositions, minimally connected matroids and rigid graphs
- The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids
- scientific article; zbMATH DE number 4160776 (Why is no real title available?)
- A sharp bound on the size of a connected matroid
- The connectivity and diameter of second order circuit graphs of matroids
- scientific article; zbMATH DE number 140137 (Why is no real title available?)
- Count and cofactor matroids of highly connected graphs
- Vertex disjoint cycles in intersection graphs of bases of matroids
- scientific article; zbMATH DE number 5138821 (Why is no real title available?)
This page was built for publication: The connectivity and minimum degree of circuit graphs of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962272)