Kolman, Petr. “On Algorithms Employing Treewidth for $L$-Bounded Cut Problems”. Journal of Graph Algorithms and Applications 22, no. 2 (January 1, 2018): 177–191. Accessed June 30, 2024. https://jgaa.info/index.php/jgaa/article/view/paper462.