Resolvable gregarious cycle decompositions of complete equipartite graphs

The complete multipartite graph Kn(m)Kn(m) with n parts of size m is shown to have a decomposition into n  -cycles in such a way that each cycle meets each part of Kn(m)Kn(m); that is, each cycle is said to be gregarious. Furthermore, gregarious decompositions are given which are also resolvable.