基于完全二分图矩阵的△(G)-边着色求解完全图K_(4n)的完备匹配

The determination of pefext matchings of a complete graph K_(4n) on the basic of △(G′)-edge colouring

给出了边矩阵和循环赛图的定义,提出了基于n(n-1)/2个完全二分图矩阵的△(G′)-边着色求解完全图K4n的完备匹配Mi的算法。阐明了循环赛图K(2i)n的构造的基本思路,介绍了完全图K20的△(G′)个完备匹配Mi的划分过程。

The definitions about edge matrix and round-robin tournament are given.An algorithm for determing pefect matchi8ngs Mi of a complete graph K4n on the basic of △(G′)-edge colouring of n(n-1)/2 complete bipartile graph matrix is propised.The basic concept of constructing round-robin tournaments of order 4n is described.The procsdure of partitioning a complete qraph K20 into △(G′) prfext matchings.