“matchings”可以造什么句，matchings造句

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

Round-robin tournaments K_(2n)~(i) and a new algorithm of the pefect matchings;