Maximum cyclic 4-cycle packings of the complete multipartite graph

Shung Liang Wu, Hung-Lin Fu*

*Corresponding author for this work

研究成果: Article

1 引文 斯高帕斯(Scopus)

摘要

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

指紋 深入研究「Maximum cyclic 4-cycle packings of the complete multipartite graph」主題。共同形成了獨特的指紋。

引用此