科研之友
微信
新浪微博
Facebook
分享链接
摘要
An H-2 graph is a multigraph on three points with a double edge between a pair of distinct points and single edges between the other two pairs. In this paper we settle the H-2 graph decomposition problem, which was unfinished in a paper of Hurd and Sarvate, by decomposing a complete multigraph 3K(8t) into H-2 graphs recursively.
- 出版日期2013-7
