The connectivity and diameter of second order circuit graphs of matroids
From MaRDI portal
Publication:1926026
DOI10.1007/s00373-011-1074-6zbMath1256.05048MaRDI QIDQ1926026
Ping Li, Hong-Jian Lai, Jin-Quan Xu
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1074-6
05C38: Paths and cycles
05B35: Combinatorial aspects of matroids and geometric lattices
05C12: Distance in graphs
05C40: Connectivity
Related Items
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
- Unnamed Item
- Paths and cycles in matroid base graphs
- A lower bound on connectivities of matroid base graphs
- Cycles in circuit graphs of matroids
- Hamilton cycles in circuit graphs of matroids
- A Fan-In Algorithm for Distributed Sparse Numerical Factorization
- Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
- Lectures on matroids
- On the Tree Graph of a Matroid
- The connectivity and minimum degree of circuit graphs of matroids