Now showing items 1-2 of 2
Slow Coloring Cyclic Permutation Graphs
The slow coloring game is played by two players, Lister and Painter, on a graph \(G\). In round \(i\), Lister marks a nonempty subset of \(V(G)\), which we'll call \(M\). By doing this he scores \(|M|\) points. Painter ...
Intersections of Graph Theory and Combinatorial Commutative Algebra
(2023-07-27) ETD File Embargoed
In this dissertation, we explore three problems in the fields of graph theory and combinatorial commutative algebra, and their intersections. First, we prove a higher upper bound for the slow coloring number of a certain ...