The connectivity and minimum degree of circuit graphs of matroids

DOI10.1007/s10114-010-6685-yzbMath1213.05029OpenAlexW2152452333MaRDI QIDQ5962272

Gui Zhen 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

connectivitymatroidcircuit graph of matroid

Mathematics Subject Classification ID

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

Related Items (4)

Vertex disjoint cycles in intersection graphs of bases of matroids ⋮ The connectivity and diameter of second order circuit graphs of matroids ⋮ The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids ⋮ Characterizations of matroids with an element lying in a restricted number of circuits

Cites Work

• Unnamed Item
• Paths and cycles in matroid base graphs
• A lower bound on connectivities of matroid base graphs
• Extremal critically connected matroids
• A Fan-In Algorithm for Distributed Sparse Numerical Factorization
• Lower-bounds on the connectivities of a graph
• The connectivity of the basis graph of a branching greedoid
• Sufficient conditions for equality of connectivity and minimum degree of a graph
• The connectivity of large digraphs and graphs

This page was built for publication: The connectivity and minimum degree of circuit graphs of matroids