peg solitaire on line graphs

In $2011$, beeler and hoilman generalized the game of peg solitaire to arbitrary connected graphs. since then peg solitaire and related games have been considered on many graph classes. one of the main goals is the characterization of solvable graphs. to this end, different graph operations, such as joins and cartesian products, have been considered in the past. in this article, we continue this venue of research by investigating line graphs. instead of playing peg solitaire on the line graph $l(g)$ of a graph $g$, we introduce a related game called stick solitaire and play it on $g$. this game is examined on several well-known graph classes, for example complete graphs and windmills. in particular, we prove that most of them are stick-solvable. we also present a family of graphs which contains unsolvable graphs in stick solitaire. naturally, the fool’s stick solitaire number is an object of interest, which we compute for the previously considered graph classes.