Hamilton cycles in circuit graphs of matroids

Authors:
Ping Li;Guizhen Liu
Affiliations:
School of Mathematics and System Sciences, Shandong University, Jinan 250100, PR China;School of Mathematics and System Sciences, Shandong University, Jinan 250100, PR China
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 3
Cited 0

A lower bound on connectivities of matroid base graphs

Discrete Mathematics
The connectivity of the basis graph of a branching greedoid

Journal of Graph Theory
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

In the circuit graph of a matroid the vertices are the circuits and the edges are the pairs CC^' such that C and C^' have nonempty intersection. It is proved that the circuit graph of a connected matroid with at least four circuits is uniformly Hamilton.