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 3 of 3 for “"peg solitaire"”.
-
Extremal Results for Peg Solitaire on Graphs
… a 2011 paper by Beeler and Hoilman, the game of peg solitaire is generalized to arbitrary boards. These boards are treated as graphs in the combinatorial sense. An open problem from that paper is to determine the minimum number of edges necessary for a graph with a fixed number of vertices to be …
-
Peg Solitaire on Trees with Diameter Four
… by Beeler and Hoilman, the traditional game of peg solitaire is generalized to graphs in the combinatorial sense. One of the important open problems in this paper was to classify solvable trees. In this thesis, we will give necessary and sufficient conditions for the solvability for all trees …
-
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 …