Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles

DOI10.1007/s10878-007-9060-xzbMath1132.05047OpenAlexW4248526218MaRDI QIDQ2471062

Chao-Chih Chou, Chin-Mei Fu

Publication date: 18 February 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9060-x

zbMATH Keywords

complete bipartite graphcycle decomposition

Mathematics Subject Classification ID

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

Related Items (12)

Decomposition of complete bipartite graphs into cycles of distinct even 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 ⋮ 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 ⋮ Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs ⋮ On Complete (s,t)-Cycle Systems of Complete Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles