KOLMAN, Petr. On Algorithms Employing Treewidth for $L$-bounded Cut Problems. Journal of Graph Algorithms and Applications, [S. l.], v. 22, n. 2, p. 177–191, 2018. DOI: 10.7155/jgaa.00462. Disponível em: http://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper462. Acesso em: 6 jul. 2024.