Decomposition de Km+Kn en cycles hamiltoniens

AbstractLet Km be the complete graph of order m. We prove that the cartesian sum Km+Kn can be decomposed into 12(m+n−2) hamiltonian cycles if m+n is even and into 12(m+n−3) hamiltonian cycles and a perfect matching if m+n is odd