Decomposition of complete bipartite graphs into generalized prisms

R. Häggkvist proved that every 3-regular bipartite graph of order 2 n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K 6 n , 6 n . In (Cichacz and Fronček, 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 , n into certain families of 3-regular graphs of order 2 n . In this paper we tackle the problem of decompositions of K n , n into certain 3-regular graphs called generalized prisms. We will show that certain families of 3-regular graphs of order 2 n decompose the complete bipartite graph K 3 n 2 , 3 n 2 .