arXiv Open Access 2026

Spanning tree congestion of proper interval graphs

Yota Otachi

Lihat Sumber

Abstrak

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

cs.DS

Yota Otachi

APA MLA BibTeX

Otachi, Y. (2026). Spanning tree congestion of proper interval graphs. https://arxiv.org/abs/2602.13756

Lihat di Sumber

Informasi Jurnal