Chin-Mei Fu

Learn More
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(More)