Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Fool's Solitaire"”.
-
Games on graphs, visibility representations, and graph colorings
… version of the f-matching game on a graph G. Peg Solitaire is a game on connected graphs introduced by Beeler and Hoilman. In the game, pegs are placed on all but one vertex. If x, y, and z form a 3-vertex path and x and y each have a peg but z does not, then we can remove the pegs at x and y and …