On the fundamental cycle set graph

We prove that there exists a one-to-one correspondence between the spanning trees and the fundamental cycle sets of a graph
G
if and only if
G
is 3-edge connected. Then we define a fundamental cycle set graph and prove that such a graph is a tree graph. It follows, therefore, that every fundamental cycle set graph on at least three vertices is Hamiltonian.