Path-Stick Solitaire on Graphs

DOI10.20429/TAG.2022.090212MaRDI QIDQ5057213zbMATH OpenOpenAlexFDO

Authors Jan-Hendrik de Wiljes, Martin Kreh

Publication date 15 December 2022

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2022.090212

zbMATH Keywords

path-stick-solvable joins of graphs

Mathematics Subject Classification ID

Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57) Structural characterization of families of graphs (05C75) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• Peg solitaire on graphs
• Fool's solitaire on graphs
• Solitaire Clobber on circulant graphs
• Peg solitaire game on Sierpinski graphs
• Constructing solvable graphs in peg solitaire
• The solitaire clobber game and correducibility of graphs
• Peg solitaire on Cartesian products of graphs
• Solitaire Clobber played on Hamming graphs
• Solitaire clobber played on Cartesian product of graphs
• Peg solitaire on graphs with jumping and merging allowed

Cited in

(5)

• Impartial solitaire clobber played on powers of paths
• scientific article; zbMATH DE number 1161318 (Why is no real title available?)
• Fool's solitaire on joins and Cartesian products of graphs
• Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire
• Peg solitaire on line graphs

This page was built for publication: Path-Stick Solitaire on Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057213)