P2k-factorization of complete bipartite multigraphs

We show that a necessary and sufficient condition for the existence of a P2k-factorization of the complete bipartite- multigraph)"Km,n is m = n = = 0 (mod k(2k- l)/d), where d = gcd()", 2k- 1). 1