Recall that a graph G is randomly Eulerian from a vertex x if and maximal trail starting at x in an Euler circuit. (If T = xx_1 ... x_l, then T is a maximal trail starting at x iff x_l is an isolated vertex in G - E(T).) Prove that a nonempty graph G is randomly Eulerian from x iff G has an Euler circuit and x is contained in every cycle of G.