Fool's solitaire on joins and Cartesian products of graphs
From MaRDI portal
Publication:482200
DOI10.1016/j.disc.2014.10.022zbMath1305.05145arXiv1402.7105OpenAlexW2077770947MaRDI QIDQ482200
Publication date: 19 December 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.7105
Games involving graphs (91A43) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)
Related Items (8)
Making graphs solvable in peg solitaire ⋮ Peg solitaire game on Sierpinski graphs ⋮ Merging peg solitaire on graphs ⋮ Peg solitaire in three colors on graphs ⋮ Peg solitaire on Cartesian products of graphs ⋮ Examples of edge critical graphs in peg solitaire ⋮ Peg solitaire on graphs with jumping and merging allowed ⋮ Reversible peg solitaire on graphs
Cites Work
This page was built for publication: Fool's solitaire on joins and Cartesian products of graphs