Maximum cyclic 4-cycle packings of the complete multipartite graph

A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipartite graph is balanced if each of its partite sets has the same size. In this paper it is proved that the complete multipartite graph G can be decomposed into 4-cycles cyclically if and only if G is balanced and 4-sufficient. Moreover, the problem of finding a maximum cyclic packing of the complete multipartite graph with 4-cycles are also presented. Keywords Complete multipartite graph · Cyclic · Cycle system · Cycle packing · 4-cycle

• Type: Journal
• Year: 2007
• Where: JCO
• Authors: Shung-Liang Wu, Hung-Lin Fu
• Keywords: Balanced, Complete Multipartite Graph, JCO 2007, Paper