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

TL;DR

This paper investigates the complexity of the $d$-Cut problem in probe $H$-free graphs, extending known results to a setting where the input graph is partially unknown and can be completed by adding edges.

Contribution

It provides a complete complexity classification of the $d$-Cut problem on partitioned probe $H$-free graphs for all graphs $H$ and integers $d",

Findings

Complexity results are established for all $H$ and $d$

The study extends classical $H$-free graph results to probe graph models

The paper characterizes when the $d$-Cut problem is polynomial-time solvable or NP-complete in this setting

Abstract

For an integer $d\geq 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 the cut. The $1$-Cut problem is the well-known Matching Cut problem. The $d$-Cut problem has been extensively studied for $H$-free graphs. We extend these results to the probe graph model, where we do not know all the edges of the input graph. For a graph $H$, a partitioned probe $H$-free graph $(G,P,N)$ consists of a graph $G=(V,E)$, together with a set $P\subseteq V$ of probes and an independent set $N=V\setminus P$ of non-probes such that we can change $G$ into an $H$-free graph by adding zero or more edges between vertices in $N$. For every graph $H$ and every integer $d\geq 1$, we completely determine the complexity of $d$-Cut on partitioned probe $H$-free graphs.