Decomposition of complete bipartite graphs into generalized prisms

R. Haggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K-6n,K-6n. In (Cichacz and Froncek, 2009) [2] the first two authors established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph K-n,K-n into certain families of 3-regular graphs of order 2n. In this paper we tackle the problem of decompositions of K-n,K-n into certain 3-regular graphs called generalized prisms. We will show that certain families of 3-regular graphs of order 2n decompose the complete bipartite graph K-3n/2.3n/2 (C) 2012 Elsevier Ltd. All rights reserved.