Decomposition of \(K_{m,n}\) into short cycles

DOI10.1016/S0012-365X(99)90063-8zbMath0934.05106MaRDI QIDQ1292828

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

Publication date: 10 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

decompositioncyclecomplete bipartite graph

Mathematics Subject Classification ID

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

Related Items (13)

Decomposition of complete bipartite graphs into cycles of distinct even lengths ⋮ Packings and Coverings of the Complete Bipartite Graph by Octagons ⋮ Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths ⋮ Decomposing various graphs into short even-length cycles ⋮ A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ Decomposition of complete bipartite graphs into paths and cycles ⋮ Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges ⋮ GENERALISATIONS OF THE DOYEN–WILSON THEOREM ⋮ Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 ⋮ Decomposition of product graphs into paths and cycles of length four ⋮ Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach ⋮ Decompositions of some classes of dense graphs into cycles of lengths 4 and 8 ⋮ Unnamed Item

Cites Work

• On Alspach's conjecture
• Exact coverings of 2-paths by 4-cycles
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decomposing the complete graph into cycles of many lengths
• Unnamed Item
• Unnamed Item

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