摘要
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.
原文 | English |
---|---|
頁(從 - 到) | 365-382 |
頁數 | 18 |
期刊 | Journal of Combinatorial Optimization |
卷 | 14 |
發行號 | 2-3 |
DOIs | |
出版狀態 | Published - 1 十月 2007 |