This paper compares the divisorial gonality of a finite graph G to the divisorial gonality of the associated metric graph Γ(G,1) with unit lengths. We show that dgon(Γ(G,1)) is equal to the minimal divisorial gonality of all regular subdivisions of G, and we provide a class of graphs for which this number is strictly smaller than the divisorial gonality of G. This settles a conjecture of M. Baker [3, Conjecture 3.14] in the negative.

@en

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 notions: stable divisorial gonality and stable gonality.

@en

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 notions: stable divisorial gonality and stable gonality.@en