Balanced bipartite 4-cycle designs

Hung-Lin Fu*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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

Original languageEnglish
Pages (from-to)3-26
Number of pages24
JournalAustralasian Journal of Combinatorics
StatePublished - 1 Dec 2005

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

Cite this