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 .