Decomposition of K_m,n into short cycles

DOI10.1016/S0012-365X(99)90063-8MaRDI QIDQ1292828zbMATH OpenFDO

Authors Chao-Chih Chou, Chin-Mei Fu, Wen-Chung Huang

Publication date 10 April 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(99)90063-8

zbMATH Keywords

complete bipartite graphcycledecomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

It is shown that if \(m\), \(n\) are even integers, \(m\geq 4\), \(n\geq 6\), then the complete bipartite graph \(K_{m,n}\) can be decomposed into \(p\) copies of \(C_4\), \(q\) copies of \(C_6\) and \(r\) copies of \(C_8\) (where \(C_i\) is the cycle of length \(i\)) whenever \(4p+ 6q+ 8r= m\cdot n\). A similar result is obtained for \(K_{m,n}-F\) (\(F\) a 1-factor) when \(n\) is odd.

Recommendations

• Decompostion of \(2K_{m,n}\) into short cycles
• scientific article; zbMATH DE number 1180724
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• scientific article; zbMATH DE number 5200598

Cites work

• Decomposing the complete graph into cycles of many lengths
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Exact coverings of 2-paths by 4-cycles
• scientific article; zbMATH DE number 1180724 (Why is no real title available?)
• scientific article; zbMATH DE number 786153 (Why is no real title available?)
• On Alspach's conjecture

Cited in

(27)

• Decomposing various graphs into short even-length cycles
• Decompositions of some classes of dense graphs into cycles of lengths 4 and 8
• Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
• Decomposing dense bipartite graphs into 4-cycles
• Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Decomposition of complete bipartite graphs into cycles of distinct even lengths
• A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes
• Decompostion of \(2K_{m,n}\) into short cycles
• Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
• Packing the complete bipartite graph with hexagons
• Decomposition of complete bipartite graphs into paths and cycles
• scientific article; zbMATH DE number 1279033 (Why is no real title available?)
• scientific article; zbMATH DE number 1355293 (Why is no real title available?)
• scientific article; zbMATH DE number 1180724 (Why is no real title available?)
• GENERALISATIONS OF THE DOYEN–WILSON THEOREM
• A new labeling of \(C_{2n}\) proves that \(K_4+M_{6n}\) decomposes \(K_{6n+4}\).
• scientific article; zbMATH DE number 1409220 (Why is no real title available?)
• Packings and Coverings of the Complete Bipartite Graph by Octagons
• Cycle decompositions of the complete graph.
• scientific article; zbMATH DE number 5200598 (Why is no real title available?)
• Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
• On decompositions of complete multipartite graphs into the union of two even cycles
• Decomposition of product graphs into paths and cycles of length four
• Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\)
• Mixed-cycle-V-super magic decomposition of complete bipartite graphs
• Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges

This page was built for publication: Decomposition of \(K_{m,n}\) into short cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292828)