Solitaire Clobber on circulant graphs

DOI10.1016/J.DISC.2014.04.006zbMATH Open1295.05155OpenAlexW1981817031MaRDI QIDQ2017045FDOQ2017045

Simone Dantas, Telma Pará, Sylvain Gravier

Publication date: 25 June 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.006

Recommendations

• Solitaire clobber played on Cartesian product of graphs
• Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
• Strong reducibility of solitaire clobber played on Cartesian product of graphs
• Impartial solitaire clobber played on powers of paths
• New results about impartial solitaire clobber

zbMATH Keywords

combinatorial gamessolitaire clobber

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)

Cites Work

• Hamilton Paths in Grid Graphs
• Solitaire Clobber played on Hamming graphs
• An introduction to clobber
• Solitaire clobber
• Solitaire clobber as an optimization problem on words
• New results about impartial solitaire clobber

Cited In (11)

• The solitaire clobber game and correducibility of graphs
• Solitaire clobber as an optimization problem on words
• Solitaire Mancala Games and the Chinese Remainder Theorem
• Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire
• Path-Stick Solitaire on Graphs
• New results about impartial solitaire clobber
• Fool's solitaire on joins and Cartesian products of graphs
• Optimal token allocation in solitaire knock'm down
• Solitaire Clobber played on Hamming graphs
• Impartial solitaire clobber played on powers of paths
• The solitaire clobber game and correducibility

This page was built for publication: Solitaire Clobber on circulant graphs

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