Analysis of a game of graph solitaire

DOI10.1080/00207390701467074MaRDI QIDQ3499212zbMATH OpenOpenAlexWikidataFDO

Authors Rohan Hemasinha

Publication date 28 May 2008

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207390701467074

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorics (educational aspects) (97K20) Operations research, economics (aspects of mathematics education) (97M40)

Recommendations

• A solitaire game played on 2-colored graphs
• The solitaire clobber game and correducibility of graphs
• Peg solitaire: ``Burn two bridges, build one
• Solitaire Clobber played on Hamming graphs
• Two graph-colouring games

Cited in

(7)

• The complexity of solitaire
• scientific article; zbMATH DE number 1792639 (Why is no real title available?)
• scientific article; zbMATH DE number 7302729 (Why is no real title available?)
• scientific article; zbMATH DE number 6318183 (Why is no real title available?)
• Solvable Trees
• Peg solitaire on graphs -- a survey
• A solitaire game played on 2-colored graphs

This page was built for publication: Analysis of a game of graph solitaire

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