If G is a tree it has no cycles
Assume G is a tree
If G has an Eulerian Circuit then the Eulerian Circuit Must repeat a vertex other than the initial vertex for G to remain a Tree
therefore there is one vertex which has no bridge.
-> it is not a tree
This is not explained as well as I could do.
Maybe there is a much simpler way of showing this.
Please advise thanks you