Suppose G is a connected graph in which each vertex has even degree. Then, G has no cut edges.
HINT: if there is a cut edge $e$, then each of the 2 components of $G\setminus \{e\}$ has exactly $1$ vertex of odd degree. The Handshake Lemma has something to say about this though.