1 citations · 1 across the 1 of their papers we have counts for
1 paper
Teeradej Kittipassorn, Panon Sinsap
In this paper, we prove that given a 2-edge-coloured complete graph K4n that has the same number of edges of each colour, we can always find a perfect matching with an equal n…