Grim on Complete Multipartite Graphs
Grim is a deletion game played on the vertices of a graph. In this paper we will examine strategies for when Grim is played on complete multipartite graphs.
Copyright (c) 2018 Sam Barretto, Jagdeep Basi, Matthew Miyake
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.