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

Ming-Hway Huang, Chin-Mei Fu () and Hung-Lin Fu ()
Additional contact information
Ming-Hway Huang: Yuanpei Institute of Science and Technology
Chin-Mei Fu: Tamkang University
Hung-Lin Fu: National Chiao Tung University

Journal of Combinatorial Optimization, 2007, vol. 14, issue 2, No 20, 323-329

Abstract: Abstract Let $K_{n_{1},n_{2},\ldots,n_{m}}$ 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.

Keywords: Complete m-partite graph; Balanced complete m-partite graph; 5-cycle; Packing; Leave; Decomposition (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9049-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:14:y:2007:i:2:d:10.1007_s10878-007-9049-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9049-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().