| Let K = K(a, p; lambda 1, lambda2) be the multigraph with: the number of vertices in each part equal to a; the number of parts equal to p; the number of edges joining any two vertices of the same part equal to lambda1; and the number of edges joining any two vertices of different parts equal to lambda2. This graph was of interest to Bose and Shimamoto in their study of group divisible designs with two associate classes [1]. Necessary and sufficient conditions for the existence of z-cycle decompositions of this graph have been found when z ∈ {3, 4}[4, 5]. The existence of resolvable 4-cycle decompositions of K has been settled when a is even [2], but the odd case is much more difficult. In this paper, necessary and sufficient conditions for the existence of a C4-factorization of K(a, p; lambda1, lambda 2) are found when a ≡ 1(mod 4) and lambda1 is even, and all cases with one exception have been solved when lambda1 is odd. |
