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的上界。即便对于可平面次立方图，我们的NP完全性结论仍然成立。