An H-3 graph is a multigraph on three vertices with double edges between two pairs of distinct vertices and a single edge between the third pair. In this paper, we decompose a complete multigraph 2K(10t) into H-3 graphs.
科研之友
微信
新浪微博
Facebook
分享链接
