Graphs of scramble number two
R Eagleton, R Morrison - Discrete Mathematics, 2023 - Elsevier
The scramble number of a graph provides a lower bound for gonality and an upper bound
for treewidth, making it a graph invariant of interest. In this paper we study graphs of …
for treewidth, making it a graph invariant of interest. In this paper we study graphs of …
Chip-firing on the Platonic solids: a primer for studying graph gonality
M Beougher, K Ding, M Everett, R Huang, C Lee… - arXiv preprint arXiv …, 2024 - arxiv.org
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 …
graphs coming from the five Platonic solids to illustrate different tools and techniques for …
On the size and complexity of scrambles
S Connor, S DiSilvio, S Kononova, R Morrison… - arXiv preprint arXiv …, 2023 - arxiv.org
The scramble number of a graph, a natural generalization of bramble number, is an invariant
recently developed to study chip-firing games and graph gonality. We introduce the carton …
recently developed to study chip-firing games and graph gonality. We introduce the carton …
The gonality of chess graphs
N Cibu, K Ding, S DiSilvio, S Kononova, C Lee… - arXiv preprint arXiv …, 2024 - arxiv.org
Chess graphs encode the moves that a particular chess piece can make on an $ m\times n $
chessboard. We study through these graphs through the lens of chip-firing games and graph …
chessboard. We study through these graphs through the lens of chip-firing games and graph …