Multiplicity-free gonality on graphs

DOI10.5614/ejgta.2023.11.2.2arXiv2107.12955MaRDI QIDQ6090311

Ralph Morrison, Max Everett, Frances Dean

Publication date: 16 December 2023

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.12955

zbMATH Keywords

chip-firing gamesgraph gonality

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Riemann-Roch theory for graph orientations
• Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
• Computing graph gonality is hard
• On the scramble number of graphs
• Treewidth is a lower bound on graph gonality
• On the gonality of Cartesian products of graphs
• A combinatorial Li-Yau inequality and rational points on curves
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Gonality of random graphs
• Harmonic Morphisms and Hyperelliptic Graphs
• Self-organized critical state of sandpile automaton models
• Gonality Sequences of Graphs

This page was built for publication: Multiplicity-free gonality on graphs