On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs

04/14/2022
by   Felicia Lucke, et al.
0

For a connected graph G=(V,E), a matching M⊆ E is a matching cut of G if G-M is disconnected. It is known that for an integer d, the corresponding decision problem Matching Cut is polynomial-time solvable for graphs of diameter at most d if d≤ 2 and NP-complete if d≥ 3. We prove the same dichotomy for graphs of bounded radius. For a graph H, a graph is H-free if it does not contain H as an induced subgraph. As a consequence of our result, we can solve Matching Cut in polynomial time for P_6-free graphs, extending a recent result of Feghali for P_5-free graphs. We then extend our result to hold even for (sP_3+P_6)-free graphs for every s≥ 0 and initiate a complexity classification of Matching Cut for H-free graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2023

Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius

The (Perfect) Matching Cut problem is to decide if a graph G has a (perf...
research
03/09/2018

Disconnected Cuts in Claw-free Graphs

A disconnected cut of a connected graph is a vertex cut that itself also...
research
10/13/2022

Perfect matching cuts partitioning a graph into complementary subgraphs

In Partition Into Complementary Subgraphs (Comp-Sub) we are given a grap...
research
04/12/2018

Graph Pattern Matching Preserving Label-Repetition Constraints

Graph pattern matching is a routine process for a wide variety of applic...
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
11/23/2021

Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter

For a fixed integer, the k-Colouring problem is to decide if the vertice...
research
05/03/2023

Complexity and Enumeration in Models of Genome Rearrangement

In this paper, we examine the computational complexity of enumeration in...

Please sign up or login with your details

Forgot password? Click here to reset