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

07/11/2023
by   Hoang-Oanh Le, et al.
0

In a graph, a (perfect) matching cut is an edge cut that is a (perfect) matching. Matching Cut (MC), respectively, Perfect Matching Cut (PMC), is the problem of deciding whether a given graph has a matching cut, respectively, a perfect matching cut. The Disconnected Perfect Matching problem (DPM) is to decide if a graph has a perfect matching that contains a matching cut. Solving an open problem recently posed in [Lucke, Paulusma, Ries (ISAAC 2022), and Feghali, Lucke, Paulusma, Ries (arXiv:2212.12317)], we show that PMC is NP-complete in graphs without induced 14-vertex path P_14. Our reduction also works simultaneously for MC and DPM, improving the previous hardness results of MC on P_19-free graphs and of DPM on P_23-free graphs to P_14-free graphs for both problems. Actually, we prove a slightly stronger result: within P_14-free graphs, it is hard to distinguish between (i) those without matching cuts and those in which every matching cut is a perfect matching cut, (ii) those without perfect matching cuts and those in which every matching cut is a perfect matching cut, and (iii) those without disconnected perfect matchings and those in which every matching cut is a perfect matching cut. Moreover, assuming the Exponential Time Hypothesis, none of these problems can be solved in time 2^o(n) for n-vertex P_14-free input graphs. We also consider the problems in graphs without long induced cycles. It is known that MC is polynomially solvable in graphs without induced cycles of length at least 5 [Moshi (JGT 1989)]. We point out that the same holds for DPM.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset