Constructing Tree Decompositions of Graphs with Bounded Gonality

Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt +1

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…