2 citations · 3 across the 14 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Maximizing Matching Cuts
Van Bang Le, Felicia Lucke, Daniël Paulusma +1
A matching cut in a graph G is an edge cut of G that is also a matching. This short survey gives an overview of old and new results and open problems for Maximum Matching Cut, whic…
math.CO2023
On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs
Felicia Lucke, Bernard Ries
In this paper, we consider the following two problems: (i) Deletion Blocker() where we are given an undirected graph and two integers and ask whether there…
math.CO2023
Dichotomies for Maximum Matching Cut: -Freeness, Bounded Diameter, Bounded Radius
Felicia Lucke, Daniël Paulusma, Bernard Ries
The (Perfect) Matching Cut problem is to decide if a graph has a (perfect) matching cut, i.e., a (perfect) matching that is also an edge cut of . Both Matching Cut and Perfe…