The Perfect Matching Cut Problem Revisited

by   Van Bang Le, et al.

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.



There are no comments yet.


page 1

page 2

page 3

page 4


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...

Diverse Pairs of Matchings

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matching...

The Perfect Matching Reconfiguration Problem

We study the perfect matching reconfiguration problem: Given two perfect...

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...

Matching Orderable and Separable Hypergraphs

A perfect matching in a hypergraph is a set of edges that partition the ...

Square-Cut Pizza Sharing is PPA-complete

We study the computational complexity of computing solutions for the squ...

Permutations With Restricted Movement

We study restricted permutations of sets which have a geometrical struct...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.