Are there any graphs with a known set of perfect matchings and other predefined properties, such as vertex connectivity, which can be used for testing the implementation of matching algorithms?
Algorithms for generating such kind of graphs, e.g. for generating random instances would also be considered as usable definitions of such instances.