Polynomial-Delay Enumeration Kernels for Bounded Degree Cuts in Graphs

This paper presents polynomial-delay enumeration kernelizations for enumerating all degree-d cuts, all minimal degree-d cuts, and all maximal degree-d cuts in a graph, parameterized by the vertex cover number, neighborhood diversity, and clique partition number of the input graph.