Hamilton cycles in circuit graphs of matroids

DOI10.1016/j.camwa.2007.04.039zbMath1147.05047OpenAlexW2094083206MaRDI QIDQ2426886

Ping Li, Gui Zhen Liu

Publication date: 14 May 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.04.039

zbMATH Keywords

matroidHamilton cyclecircuit graph of matroidcritical matroiduniformly Hamilton

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Vertex disjoint cycles in intersection graphs of bases of matroids ⋮ Properties of Hamilton cycles of circuit graphs of matroids ⋮ The connectivity and diameter of second order circuit graphs of matroids ⋮ 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
• Extremal critically connected matroids
• Matroid basis graphs. I
• Matroid basis graphs. II
• 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