Solitaire Clobber on circulant graphs
From MaRDI portal
Publication:2017045
Recommendations
- Solitaire clobber played on Cartesian product of graphs
- Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
- Strong reducibility of solitaire clobber played on Cartesian product of graphs
- Impartial solitaire clobber played on powers of paths
- New results about impartial solitaire clobber
Cites work
Cited in
(14)- The solitaire clobber game and correducibility of graphs
- Solitaire clobber played on Cartesian product of graphs
- The solitaire clobber game and correducibility
- Impartial solitaire clobber played on powers of paths
- Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
- Solitaire Clobber played on Hamming graphs
- Solitaire clobber as an optimization problem on words
- New results about impartial solitaire clobber
- Fool's solitaire on joins and Cartesian products of graphs
- Strong reducibility of solitaire clobber played on Cartesian product of graphs
- Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire
- Path-Stick Solitaire on Graphs
- Solitaire Mancala Games and the Chinese Remainder Theorem
- Optimal token allocation in solitaire knock'm down
This page was built for publication: Solitaire Clobber on circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017045)