Properties of Hamilton cycles of circuit graphs of matroids
From MaRDI portal
Publication:382146
DOI10.1007/s11464-013-0240-yzbMath1276.05025MaRDI QIDQ382146
Publication date: 18 November 2013
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-013-0240-y
05B35: Combinatorial aspects of matroids and geometric lattices
05C45: Eulerian and Hamiltonian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Paths and cycles in matroid base graphs
- Paths in circuit graphs of matroids
- A lower bound on connectivities of matroid base graphs
- Pancyclic graphs. II
- Cycles in circuit graphs of matroids
- Hamilton cycles in circuit graphs of matroids
- Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
- The connectivity of the basis graph of a branching greedoid
- On the Tree Graph of a Matroid