Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber

DOI10.1016/J.ENDM.2011.05.031MaRDI QIDQ2840705zbMATH OpenOpenAlexFDO

Authors Telma Pará, Simone Dantas, Sylvain Gravier

Publication date 23 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.2011.05.031

zbMATH Keywords

graph theorycombinatorial gamesimpartial gamesimpartial solitaire clobber

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• A survey of Solitaire Clobber
• An introduction to clobber
• Hamilton Paths in Grid Graphs
• Impartial solitaire clobber played on powers of paths
• 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
• Solitaire clobber played on Cartesian product of graphs
• Impartial solitaire clobber played on powers of paths
• The solitaire clobber game and correducibility
• Strong reducibility of solitaire clobber played on Cartesian product of graphs

This page was built for publication: Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber

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