A u,v-necklace is a list of cycles C1,C2,...,Ck such that u e C1, e 2 Ck, consecutive

cycles share exactly one vertex, and nonconsecutive cycles are disjoint. Use

induction on d(u,v) to prove that a graph G is 2-edge-connected if and only if for all

u, v e V(G) there is a u,v-necklace in G.

I have no idea how to prove this...