Cyclic One-Factorization of the Complete Graph
暂无分享,去创建一个
It is shown that the complete graph K n has a cyclic 1-factorization if and only if n is even and n ≠2 t , t ⩾3.
[1] N. P. Korovina. Systems of pairs of cyclic type , 1980 .