科研之友
微信
新浪微博
Facebook
分享链接
摘要
Necessary conditions for a simple connected graph G to admit a decomposition into closed trails of length k a parts per thousand yen 3 are that G is even and its total number of edges is a multiple of k. In this paper we show that these conditions are sufficient in the case when G is the complete equipartite graph having at least three parts, each of the same size.
- 出版日期2010-1
