Grim on Complete Multipartite Graphs

  • Sam Barretto California State University, Fresno
  • Jagdeep Basi California State University, Fresno
  • Matthew Miyake California State University, Fresno
DOI: https://doi.org/10.46787/pump.v1i0.150
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. https://doi.org/10.46787/pump.v1i0.150
Issue
Vol. 1 (2018): PUMP Journal of Undergraduate Research
Section
Articles

Copyright (c) 2018 Sam Barretto, Jagdeep Basi, Matthew Miyake

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

The author(s) will retain the copyright, but by submitting the article agree to grant permission to the PUMP Journal of Undergraduate Research to publish, distribute, and archive the article. The author(s) will acknowledge prior publication in the PUMP Journal of Undergraduate Research for all future uses of the article or parts of it.