TY - GEN

T1 - Note on decomposition of kn,n into (0, j)-prisms

AU - Cichacz, Sylwia

AU - Fronček, Dalibor

AU - Kovář, Petr

PY - 2009/12/1

Y1 - 2009/12/1

N2 - R. Häggkvist 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 .

AB - R. Häggkvist 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 .

UR - http://www.scopus.com/inward/record.url?scp=78650621195&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650621195&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10217-2_15

DO - 10.1007/978-3-642-10217-2_15

M3 - Conference contribution

AN - SCOPUS:78650621195

SN - 3642102166

SN - 9783642102165

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 125

EP - 133

BT - Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers

T2 - 20th International Workshop on Combinatorial Algorithms, IWOCA 2009

Y2 - 28 June 2009 through 2 July 2009

ER -