A lower bound on connectivities of matroid base graphs

DOI10.1016/0012-365X(88)90177-XzbMath0642.05049OpenAlexW2016957139MaRDI QIDQ1101135

Gui Zhen Liu

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90177-x

zbMATH Keywords

graph connectivitymatroid corank

Mathematics Subject Classification ID

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

Related Items (11)

Determining the minimum rank of matroids whose basis graph is common ⋮ Cycles in circuit graphs of matroids ⋮ Properties of Hamilton cycles of circuit graphs of matroids ⋮ The connectivity and diameter of second order circuit graphs of matroids ⋮ Hamilton cycles in circuit graphs of matroids ⋮ Nowhere-zero 3-flows in matroid base graph ⋮ Paths in circuit graphs of matroids ⋮ Counting Hamiltonian cycles in the matroid basis graph ⋮ The connectivity and minimum degree of circuit graphs of matroids ⋮ Characterizations of matroids with an element lying in a restricted number of circuits ⋮ The connectivities of leaf graphs of 2-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Paths and cycles in matroid base graphs
• A characterization of complete matroid base graphs
• Matroid basis graphs. I
• A Graphical Representation of Matroids
• On the Tree Graph of a Matroid

This page was built for publication: A lower bound on connectivities of matroid base graphs