Note on Decomposition of Kn, n into (0, j)-prisms

R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the first two authors established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn,n into certain families of 3-regular graphs of order 2n. In this paper we tackle the problem of decompositions of Kn,n into 3-regular graphs some more. We will show that certain families of 3-regular graphs of order 2n decompose the complete bipartite graph K3n 2 , 3n 2 .

• Type: Conference
• Year: 2009
• Where: IWOCA
• Authors: Sylwia Cichacz, Dalibor Froncek, Petr Kovár
• Keywords: 3-regular Bipartite Graph, 3-regular Graphs, Complete Bipartite Graph, IWOCA 2009