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完整性结果甚至维持在平面的子立方图上。