### Abstract

Let (λ_{1}, λ_{2}, λ_{3})K_{v1,v2} denote the graph G with V(G) = V_{1} ∪ V_{2}, V_{1} ∩ V_{2} = 0, |V_{1}| =v_{1}, |V_{2}| = v_{2}, and the edges of G are obtained by joining (a) each pair of vertices in V_{i}, i = 1,2, exactly λ_{i} times and (b) each pair of vertices from V_{1} to V_{2} exactly λ_{3} times. In this paper, we determine all quintuples (λ_{1}, λ_{2}, λ_{3}; v_{1}, v_{2}) such that (λ_{1}, λ_{2}, λ_{3})K_{v1,v2} can be decomposed into 4- cycles.

Original language | English |
---|---|

Pages (from-to) | 3-26 |

Number of pages | 24 |

Journal | Australasian Journal of Combinatorics |

Volume | 32 |

State | Published - 1 Dec 2005 |

## Fingerprint Dive into the research topics of 'Balanced bipartite 4-cycle designs'. Together they form a unique fingerprint.

## Cite this

Fu, H-L. (2005). Balanced bipartite 4-cycle designs.

*Australasian Journal of Combinatorics*,*32*, 3-26.