Paths in circuit graphs of matroids

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.