The connectivity and minimum degree of circuit graphs of matroids

DOI10.1007/S10114-010-6685-YzbMATH Open1213.05029OpenAlexW2152452333MaRDI QIDQ5962272FDOQ5962272

Ping Li, Guizhen Liu

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)

Cites Work

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

Cited In (7)

• 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
• A sharp bound on the size of a connected matroid
• The connectivity and diameter of second order circuit graphs of matroids
• Title not available (Why is that?)
• Vertex disjoint cycles in intersection graphs of bases of matroids
• Title not available (Why is that?)

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)