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 .