The Perfect Matching Cut Problem Revisited

07/13/2021
by   Van Bang Le, et al.
0

In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and show that PMC remains NP-complete when restricted to bipartite graphs of maximum degree 3 and arbitrarily large girth. Complementing this hardness result, we give two graph classes in which PMC is polynomial time solvable. The first one includes claw-free graphs and graphs without an induced path on five vertices, the second one properly contains all chordal graphs. Assuming the Exponential Time Hypothesis, we show there is no O^*(2^o(n))-time algorithm for PMC even when restricted to n-vertex bipartite graphs, and also show that PMC can be solved in O^*(1.2721^n) time by means of an exact branching algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2022

Matching Cuts in Graphs of High Girth and H-Free Graphs

The (Perfect) Matching Cut is to decide if a graph has a (perfect) match...
research
07/11/2023

Complexity results for matching cut problems in graphs without long induced paths

In a graph, a (perfect) matching cut is an edge cut that is a (perfect) ...
research
04/30/2018

A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

In a graph, a matching cut is an edge cut that is a matching. Matching C...
research
10/26/2022

Inapproximability of shortest paths on perfect matching polytopes

We consider the computational problem of finding short paths in the skel...
research
09/09/2020

Diverse Pairs of Matchings

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matching...
research
04/12/2019

The Perfect Matching Reconfiguration Problem

We study the perfect matching reconfiguration problem: Given two perfect...
research
04/14/2022

On restricted completions of chordal and trivially perfect graphs

Let G be a graph having a vertex v such that H = G - v is a trivially pe...

Please sign up or login with your details

Forgot password? Click here to reset