The solitaire clobber game and correducibility of graphs
From MaRDI portal
Publication:2184676
Recommendations
Cites work
- A survey of Solitaire Clobber
- An introduction to clobber
- Impartial solitaire clobber played on powers of paths
- Solitaire clobber
- Solitaire clobber as an optimization problem on words
- Solitaire Clobber on circulant graphs
- Solitaire clobber played on Cartesian product of graphs
- Solitaire Clobber played on Hamming graphs
- Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
Cited in
(10)- Solitaire clobber played on Cartesian product of graphs
- The solitaire clobber game and correducibility
- scientific article; zbMATH DE number 6007629 (Why is no real title available?)
- Analysis of a game of graph solitaire
- 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
- The Solitaire Clobber game and the correducibility of k-connected graphs
This page was built for publication: The solitaire clobber game and correducibility of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184676)