The handshaking lemma

The set of all edges of a graph can be partitioned into cycles iff every vertex is of even degree.

A graph is bipartite graph iff each of his cycles are of even length.

A graph is a forest if and only if each pair of distinct edges there’s only one path from to .