| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436386 | Theoretical Computer Science | 2008 | 6 Pages |
Abstract
Let G be the circuit graph of any connected matroid. It is proved that for any two vertices of G, there is a path of length k joining them for any integer k satisfying 2≤k≤|V(G)|−1.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
