Consider fundamental cycles (say $k$ of them) of a specific spanning tree of a simple graph which is also connected and has no one-edge bonds. I would like to prove:

If there is a unique way of selecting one edge from each of these cycles, then this selection of $k$ edges constitutes a cotree.