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

DOI10.1016/J.ENDM.2011.05.031zbMATH Open1268.05131OpenAlexW2042122095MaRDI QIDQ2840705FDOQ2840705

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

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

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)

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
• Impartial solitaire clobber played on powers of paths
• Title not available (Why is that?)

Cited In (4)

• 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

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)