Grim on Complete Multipartite Graphs

  • Sam Barretto California State University, Fresno
  • Jagdeep Basi California State University, Fresno
  • Matthew Miyake California State University, Fresno
Keywords: Combinatorial game theory, graphs

Abstract

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.

Published
2018-07-03
How to Cite
Barretto, S., Basi, J., & Miyake, M. (2018). Grim on Complete Multipartite Graphs. The PUMP Journal of Undergraduate Research, 1, 48-61. Retrieved from https://journals.calstate.edu/pump/article/view/150