13 citations · 45 across the 24 of their papers we have counts for
11 papers · 1 filter
Impartial geodetic building games on graphs
Bret J. Benesh, Dana C. Ernst, Marie Meyer +2
A subset of the vertex set of a graph is geodetically convex if it contains every vertex on any shortest path between two elements of the set. The convex hull of a set of vertices…
Impartial Achievement Games on Convex Geometries
Stephanie McCoy, Nándor Sieben
We study a game where two players take turns selecting points of a convex geometry until the convex closure of the jointly selected points contains all the points of a given winnin…
Impartial achievement games for generating generalized dihedral groups
Bret J. Benesh, Dana C. Ernst, Nandor Sieben
We study an impartial game introduced by Anderson and Harary. This game is played by two players who alternately choose previously-unselected elements of a finite group. The first…
Impartial avoidance and achievement games for generating symmetric and alternating groups
Bret J. Benesh, Dana C. Ernst, Nandor Sieben
We study two impartial games introduced by Anderson and Harary. Both games are played by two players who alternately select previously-unselected elements of a finite group. The fi…
Impartial avoidance games for generating finite groups
Bret J. Benesh, Dana C. Ernst, Nandor Sieben
We study an impartial avoidance game introduced by Anderson and Harary. The game is played by two players who alternately select previously unselected elements of a finite group. T…
Impartial achievement and avoidance games for generating finite groups
Dana C. Ernst, Nandor Sieben
We study two impartial games introduced by Anderson and Harary and further developed by Barnes. Both games are played by two players who alternately select previously unselected el…