Hamilton paths and cycles in flip graphs of (almost-)perfect matchings

Sofia Brenner, Justin Dallant, Linda Kleist +3

We consider the set of matchings of a graph and a local change operation, called a flip, between them. In the combinatorial setting, the base graphs are either complete graphs or c…