Cycles in circuit graphs of matroids

DOI10.1007/s00373-007-0739-7zbMath1124.05021OpenAlexW2075859788MaRDI QIDQ2385136

Ping Li, Gui Zhen Liu

Publication date: 11 October 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0739-7

zbMATH Keywords

MatroidCircuit graph of matroidEdge-pancyclic

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Paths in circuit graphs of matroids ⋮ Characterizations of matroids with an element lying in a restricted number of circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paths and cycles in matroid base graphs
• A lower bound on connectivities of matroid base graphs
• Pancyclic graphs. II
• 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

This page was built for publication: Cycles in circuit graphs of matroids