for a (connected, finite) graph $g$, we define its genus to be the quantity $g := e - v + 1$, where $e$ is the number of edges of $g$ and $v$ is the number of vertices. while it is not the case that graph homomorphisms preserve this invariant, it is the case that contractions between graphs do. in this talk we will consider the category of all genus $g$ graphs and contractions. more specifically, we consider integral representations of the opposite category, i.e. functors from the opposite category to abelian groups. using the combinatorics of graph minors, we will show that representations of this kind satisfy a noetherian property. as applications of this technical result, we show that configuration spaces of graphs as well as kazhdan-lusztig polynomials of graphical matroids must satisfy strong finiteness conditions. this is joint work with nick proudfoot.