Decomposition of \(K_{m,n}\) into short cycles
type: Item
instance of: scholarly article
title: Decomposition of \(K_{m,n}\) into short cycles
zbMATH Open document ID: 0934.05106
DOI: 10.1016/S0012-365X(99)90063-8
author: Chao-Chih Chou
author: Chin-Mei Fu
author: Wen-Chung Huang
published in: Discrete Mathematics
publication date: 2000-04-10T00:00:00Z
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.
reviewed by: Alexander Rosa
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1322012
zbMATH Keywords: decomposition
zbMATH Keywords: complete bipartite graph
zbMATH Keywords: cycle
MaRDI profile type: Publication
cites work: Decomposing the complete graph into cycles of many lengths
cites work: Q4399766
cites work: On Alspach's conjecture
cites work: Exact coverings of 2-paths by 4-cycles
cites work: Q4842729
cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
description: scientific article; zbMATH DE number 1322012