1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2024★ 1 cited
On polynomial kernelization for Stable Cutset
Stefan Kratsch, Van Bang Le
A stable cutset in a graph is a set such that vertices of are pairwise non-adjacent and such that is disconnected, i.e., it is both stable (or indep…
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…