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.

翻译：我们证明了边多路割（亦称多端割）与点多路割在最大度为$3$的图（即次立方图）上是NP完全的。该结论将先前已知的度界从$11$改进至$3$。我们的NP完全性结果甚至对平面次立方图同样成立。