K1,p2-factorization of complete bipartite graphs

In this note, we investigate the factorization of a bipartite multigraph λKm,n into copies of K1,p2 whenever p is a prime number. We give a trivial necessary condition for such a factorization to exist and a sufficient condition for the cases λ = 1, λ − p and λ = p2.