完全图K_(11)及K_(12)的边不相交的H圈的个数

Number of non-intersected Hamilton Cycles of complete graphs K_(11) and K_(12)

给出了边矩阵及n-圈着色的定义。阐明了完全图KV的1因子分解及2因子分解的思路。证明了完全图KV的2因子分解的定理。介绍了K11及K12的2因子分解的全过程。

The definitions about edge matrix and n-cycles colouring are given. The concept of 1-factorization and 2-factorization of complete graph Kv is described. The theorems on 2-factorization of compete graphs Kv are proved. The entire procedure of 2-factorization of K11 and K12 is presented.