1 citations · 1 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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.CO2022★ 1 cited
Finding Matching Cuts in -Free Graphs
Felicia Lucke, Daniël Paulusma, Bernard Ries
The NP-complete problem Matching Cut is to decide if a graph has a matching that is also an edge cut of the graph. We prove new complexity results for Matching Cut restricted to $H…