2 citations · 5 across the 5 of their papers we have counts for
1 paper · 1 filter
Roy H. Jennings
Let Pm be the graph on the set of perfect matchings in the complete graph K2m, where two perfect matchings are connected by an edge if their symmetric differenc…