- document
-
Bodlaender, Hans L. (author), van Dobben de Bruyn, J. (author), Gijswijt, Dion (author), Smit, Harry (author)In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most k, when an effective divisor of degree k that reaches all vertices is given. We also give a similar result for two related...journal article 2021
- document
-
Bodlaender, Hans L. (author), van Dobben de Bruyn, J. (author), Gijswijt, Dion (author), Smit, Harry (author)In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most k, when an effective divisor of degree k that reaches all vertices is given. We also give a similar result for two related...conference paper 2020