Finding $d$-Cuts in Probe $H$-Free Graphs

Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson +2

For an integer $d\ge 1$, the $d$-Cut problem is that of deciding whether a graph has an edge cut in which each vertex is adjacent to at most $d$ vertices on the opposite side of t…