## 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 K_{6n,6n}. In [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 2n. In this paper we tackle the problem of decompositions of K_{n,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 K_{3n/2,3n/2} .

Original language | English (US) |
---|---|

Title of host publication | Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers |

Pages | 125-133 |

Number of pages | 9 |

DOIs | |

State | Published - Dec 1 2009 |

Event | 20th International Workshop on Combinatorial Algorithms, IWOCA 2009 - Hradec nad Moravici, Czech Republic Duration: Jun 28 2009 → Jul 2 2009 |

### Publication series

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

Volume | 5874 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 20th International Workshop on Combinatorial Algorithms, IWOCA 2009 |
---|---|

Country/Territory | Czech Republic |

City | Hradec nad Moravici |

Period | 6/28/09 → 7/2/09 |

## Fingerprint

Dive into the research topics of 'Note on decomposition of k_{n,n}into (0, j)-prisms'. Together they form a unique fingerprint.