The Girth of the Maximum Matching Graph
Yan Liu, L Yixun · Or Transactions · 2001
The maximum matching graph of a graph has a vertex for each maximum matching and an edge for each pair of maximum matchings one of which can be transformed to another by exchanging an edge. In this paper, the girth of the maximum matching graph is studied. As a result, the conditions of the maximum matching graph being a tree or a complete graph axe obtained.