The scramble number of a graph is an invariant recently developed to study chip-firing
games and divisorial gonality. In this paper we introduce the screewidth of a graph, based …

Let $ G $ be a finite graph of genus $ g $. Let $ d $ and $ r $ be non-negative integers such
that the Brill-Noether number is non-negative. It is known that for some $ k $ sufficiently …

This paper provides a friendly introduction to chip-firing games and graph gonality. We use
graphs coming from the five Platonic solids to illustrate different tools and techniques for …

We provide a new perspective on the divisor theory of graphs, using additive combinatorics.
As a test case for this perspective, we compute the gonality of certain families of outerplanar …

Divisorial gonality of graphs, the slice rank polynomial method, and tensor products of
convex cones Page 1 Delft University of Technology Divisorial gonality of graphs, the slice …

The $ r $ th gonality of a graph is the smallest degree of a divisor on the graph with rank $ r
$. The gonality sequence of a graph is a tropical analogue of the gonality sequence of an …