Consider fundamental cycles of a specific spanning tree of a simple graph. I would like to prove:

Any co-tree of the graph can be built by selecting one edge from each of these cycles; furthermore, this selection is unique.