Higher Hardness Results for the Reconfiguration of Odd Matchings

Joseph Dorfer

We study the reconfiguration of odd matchings of combinatorial graphs. Odd matchings are matchings that cover all but one vertex of a graph. A reconfiguration step, or flip, is an…