The solitaire clobber game and correducibility of graphs

DOI10.1016/j.dam.2019.06.023zbMath1440.05147OpenAlexW2961528149MaRDI QIDQ2184676

Simone Dantas, Slobodan Tanushevski, R. Marinho

Publication date: 29 May 2020

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

Full work available at URL: https://doi.org/10.1016/j.dam.2019.06.023

zbMATH Keywords

graph connectivitycombinatorial gamessolitaire clobber

Mathematics Subject Classification ID

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

Cites Work

• Solitaire clobber
• Solitaire Clobber on circulant graphs
• Solitaire clobber played on Cartesian product of graphs
• Impartial Solitaire Clobber played on Powers of Paths
• Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The solitaire clobber game and correducibility of graphs