Impartial solitaire clobber played on powers of paths

DOI10.1016/J.ENDM.2009.11.042MaRDI QIDQ2840546zbMATH OpenOpenAlexFDO

Authors Telma Pará, Sylvain Gravier, Simone Dantas

Publication date 19 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.11.042

zbMATH Keywords

graph theoryimpartial gamesimpartial solitaire clobber

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Solitaire clobber played on Cartesian product of graphs
• Solitaire Clobber played on Hamming graphs
• Solitaire Clobber on circulant graphs
• Path-Stick Solitaire on Graphs
• Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
• The solitaire clobber game and correducibility
• New results about impartial solitaire clobber
• Solitaire clobber
• A survey of Solitaire Clobber
• Fool's solitaire on graphs

Cites work

• A survey of Solitaire Clobber
• An introduction to clobber
• Hamilton Paths in Grid Graphs
• Solitaire Clobber played on Hamming graphs
• Solitaire clobber
• Solitaire clobber as an optimization problem on words

Cited in

(6)

• Solitaire Clobber on circulant graphs
• The solitaire clobber game and correducibility of graphs
• New results about impartial solitaire clobber
• A survey of Solitaire Clobber
• Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
• The solitaire clobber game and correducibility

This page was built for publication: Impartial solitaire clobber played on powers of paths

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