Packing 5-cycles into balanced complete m -partite graphs for odd m

Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this complete m-partite graph by Km(n). In this paper, we completely solve the problem of finding a maximum packing of the balanced complete m-partite graph Km(n), m odd, with edge-disjoint 5-cycles and we explicitly give the minimum leaves. Keywords Complete m-partite graph · Balanced complete m-partite graph · 5-cycle · Packing · Leave · Decomposition

• Type: Journal
• Year: 2007
• Where: JCO
• Authors: Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu
• Keywords: Balanced, Complete M-partite Graph, JCO 2007, Maximum Packing