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

Sylwia Cichacz, Dalibor Fronček, Petr Kovář

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

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 .

Original languageEnglish (US)
Title of host publicationCombinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers
Pages125-133
Number of pages9
DOIs
StatePublished - Dec 1 2009
Event20th International Workshop on Combinatorial Algorithms, IWOCA 2009 - Hradec nad Moravici, Czech Republic
Duration: Jun 28 2009Jul 2 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5874 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th International Workshop on Combinatorial Algorithms, IWOCA 2009
CountryCzech Republic
CityHradec nad Moravici
Period6/28/097/2/09

Fingerprint Dive into the research topics of 'Note on decomposition of k<sub>n,n</sub> into (0, j)-prisms'. Together they form a unique fingerprint.

Cite this