Abstract

In this thesis we study several graph problems. In the first part, we study the ‘gonality’ of graphs. This is a measure for the complexity of a graph. There are several variants of gonality. The divisorial gonality can be defined as a chip-firing game, the stable gonality is defined using
... read more