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...
share
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
∙
10/19/2022
Reducing Graph Parameters by Contractions and Deletions
We consider the following problem: for a given graph G and two integers ...
research
∙
07/14/2022
Finding Matching Cuts in H-Free Graphs
The NP-complete problem Matching Cut is to decide if a graph has a match...
research
∙
04/14/2022
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs
For a connected graph G=(V,E), a matching M⊆ E is a matching cut of G if...
research
∙
02/17/2022