In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.
|Number of pages||21|
|Journal||Journal of Combinatorial Designs|
|State||Published - 1 Jan 2001|
- Cycle packing