The connectivity and minimum degree of circuit graphs of matroids

DOI10.1007/S10114-010-6685-YMaRDI QIDQ5962272zbMATH OpenOpenAlexFDO

Authors Guizhen Liu, Ping Li

Publication date 21 September 2010

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-010-6685-y

zbMATH Keywords

circuit graph of matroidconnectivitymatroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Recommendations

• A lower bound on connectivities of matroid base graphs
• Proof of a conjecture on matroid base graphs
• scientific article; zbMATH DE number 4160776
• Connected matroids with a small circumference
• On large circuits in matroids

Cites work

• A Fan-In Algorithm for Distributed Sparse Numerical Factorization
• A lower bound on connectivities of matroid base graphs
• Extremal critically connected matroids
• scientific article; zbMATH DE number 3472075 (Why is no real title available?)
• 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

(13)

• A lower bound on connectivities of matroid base graphs
• The connectivity and diameter of second order circuit graphs of matroids
• Characterizations of matroids with an element lying in a restricted number of circuits
• A sharp bound on the size of a connected matroid
• Vertex disjoint cycles in intersection graphs of bases of matroids
• scientific article; zbMATH DE number 5138821 (Why is no real title available?)
• scientific article; zbMATH DE number 4160776 (Why is no real title available?)
• scientific article; zbMATH DE number 140137 (Why is no real title available?)
• The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids
• Ear‐decompositions, minimally connected matroids and rigid graphs
• Count and cofactor matroids of highly connected graphs
• The spanning 3-connectivity of circuit graphs of matroids
• Paths in circuit graphs of matroids

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)