In this paper, we completely solve the problem of finding a maximum packing of any balanced complete multipartite graph \(K_{m}(n)\) with edge-disjoint \(6\)-cycles, and minimum leaves are explicitly given.
Subsequently, we also find a minimum covering of \(K_{m}(n)\).
1970-2025 CP (Manitoba, Canada) unless otherwise stated.