
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.
Games on graphs (graph-theoretic aspects), Combinatorial games, game on graphs, Games involving graphs, complete multipartite graphs
Games on graphs (graph-theoretic aspects), Combinatorial games, game on graphs, Games involving graphs, complete multipartite graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
