The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids

DOI10.1142/S1793830922500070zbMath1493.05060OpenAlexW3211954811WikidataQ114071639 ScholiaQ114071639MaRDI QIDQ5101897

Zijian Deng, Bin Liu, Bo Deng, Bofeng Huo

Publication date: 2 September 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500070

zbMATH Keywords

Hamiltonianconnectivitymatroidcycle matroid of a wheelsecond-order circuit graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• The connectivity and diameter of second order circuit graphs of matroids
• Cycles in circuit graphs of matroids
• Hamilton cycles in circuit graphs of matroids
• Matroids and Graphs
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• On the Abstract Properties of Linear Dependence
• Connectivity in Matroids
• Lectures on matroids
• The connectivity and minimum degree of circuit graphs of matroids

This page was built for publication: The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids