Grim on Complete Multipartite Graphs

  • Sam Barretto California State University, Fresno
  • Jagdeep Basi California State University, Fresno
  • Matthew Miyake California State University, Fresno

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, Sam; BASI, Jagdeep; MIYAKE, Matthew. Grim on Complete Multipartite Graphs. The PUMP Journal of Undergraduate Research, [S.l.], v. 1, p. 48-61, july 2018. ISSN 2576-3725. Available at: <https://math.csudh.edu/pumpjournal/index.php/pump/article/view/17>. Date accessed: 18 july 2018.