Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber

DOI10.1016/j.endm.2011.05.031zbMath1268.05131OpenAlexW2042122095MaRDI QIDQ2840705

Sylvain Gravier, Simone Dantas, Telma Pará

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 involving graphs (91A43) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

The solitaire clobber game and correducibility ⋮ The solitaire clobber game and correducibility of graphs ⋮ Solitaire clobber played on Cartesian product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solitaire clobber
• Impartial Solitaire Clobber played on Powers of Paths
• Hamilton Paths in Grid Graphs

This page was built for publication: Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber