Properties of Hamilton cycles of circuit graphs of matroids

DOI10.1007/s11464-013-0240-yzbMath1276.05025OpenAlexW2085011949MaRDI QIDQ382146

Gui Zhen Liu, Hao Fan

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

zbMATH Keywords

matroidHamilton cyclecircuit graph of matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45)

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

This page was built for publication: Properties of Hamilton cycles of circuit graphs of matroids