We show that the spanning tree congestion problem is NP-complete even for proper interval graphs of linear clique-width at most 4.

翻译：我们证明了即使对于线性团宽度至多为4的真区间图，生成树拥塞问题也是NP完全的。