科研之友
微信
新浪微博
Facebook
分享链接
摘要
An H-decomposition of the complete equipartite graph K-m(n) is a partition of the edge set of K-m(n) into subsets such that each subset induces a graph isomorphic to H. In this paper, for each connected unicyclic graph H of size 5, we determine the set of values of m and n for which K-m(n) has an H-decomposition.
- 出版日期2015-7
