Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs

11/22/2022

∙

by   Matthew Alastair Johnson, et al.

∙

0

∙

share

We show that Edge Multiway Cut (also called Multiterminal Cut) and Node Multiway Cut are NP-complete on graphs of maximum degree 3 (also known as subcubic graphs). This improves on a previous degree bound of 11. Our NP-completeness result holds even for subcubic graphs that are planar.