Round-robin tournament arrangement and K+1-edge colouring of the edge mafpix K′_(2n+1)
Chou Wan-xi · Journal of Anhui Institute of Architecture & Industry · 2006
To make that a complete graph K_(2n+1)become useful for round-robin yournameny arrangemeny,the definitions about edge motrix and round-robin tournament are given an algorithm for determining K+1 pefect matchings of a complete graph K_(2n+1) by using K+1-edge colouring of edge matric K′_(2n+1) is ppoposed.The constructed results and the aplications of round-robin tournaments K~((i))_(13),K~((i))_((15)),…,K~((i))_((22))are ppesented.