A lower bound on connectivities of matroid base graphs

Authors:
Guizhen Liu
Affiliations:
Simon Fraser University, Burnaby, Canada
Venue:
Discrete Mathematics
Year:
1988

Citing 0
Cited 3

Hamilton cycles in circuit graphs of matroids

Computers & Mathematics with Applications
Note: Paths in circuit graphs of matroids

Theoretical Computer Science
The Edge Connectivity of Circuit Graphs of Matroids

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007

Quantified Score

Hi-index	0.05

Visualization

Abstract