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

Ming Hway Huang, Chin Mei Fu*, Hung-Lin Fu

*Corresponding author for this work

Research output: Contribution to journalArticle

3 Scopus citations


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

Original languageEnglish
Pages (from-to)323-329
Number of pages7
JournalJournal of Combinatorial Optimization
Issue number2-3
StatePublished - 1 Oct 2007


  • 5-cycle
  • Balanced complete m-partite graph
  • Complete m-partite graph
  • Decomposition
  • Leave
  • Packing

Fingerprint Dive into the research topics of 'Packing 5-cycles into balanced complete m-partite graphs for odd m'. Together they form a unique fingerprint.

  • Cite this