Next we consider 2-factorizations of the complete graph . observe first that if K is 2-factorable , then P is odd since p-1 must be a multiple of 2 . we will verify that K2n+1 is 2-factorable for all positive integers n by presenting an even stronger result A spanning cycle in a graph G is called a Hamiltonian cycle of G .