The Perfect Matching Reconfiguration Problem

04/12/2019
by   Marthe Bonamy, et al.
0

We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of length four. We are interested in the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem is PSPACE-complete even for split graphs and for bipartite graphs of bounded bandwidth with maximum degree five. We then investigate polynomial-time solvable cases. Specifically, we prove that the problem is solvable in polynomial time for strongly orderable graphs (that include interval graphs and strongly chordal graphs), for outerplanar graphs, and for cographs (also known as P_4-free graphs). Furthermore, for each yes-instance from these graph classes, we show that a linear number of flip operations is sufficient and we can exhibit a corresponding sequence of flip operations in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2021

The Perfect Matching Cut Problem Revisited

In a graph, a perfect matching cut is an edge cut that is a perfect matc...
research
08/28/2019

Revisiting a Cutting Plane Method for Perfect Matchings

In 2016, Chandrasekaran, Végh, and Vempala published a method to solve t...
research
02/19/2018

Reconfiguration of Colorable Sets in Classes of Perfect Graphs

A set of vertices in a graph is c-colorable if the subgraph induced by t...
research
07/03/2019

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles

Motivated by adjacency in perfect matching polytopes, we study the short...
research
06/01/2022

Weak consistency of P-time event graphs

P-time event graphs (P-TEGs) are event graphs where the residence time o...
research
05/03/2018

How to Secure Matchings Against Edge Failures

The matching preclusion number of a graph is the minimal number of edges...
research
03/05/2019

The Complexity of Morality: Checking Markov Blanket Consistency with DAGs via Morality

A family of Markov blankets in a faithful Bayesian network satisfies the...

Please sign up or login with your details

Forgot password? Click here to reset