✦ LIBER ✦

A solitaire game played on 2-colored graphs

✍ Scribed by David Craft; Zevi Miller; Dan Pritikin

Book ID: 108113989
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 973 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.069

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Nim game played on graphs

✍ Masahiko Fukuyama 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 262 KB

We propose a new impartial game played by two players, which can be compared to the well-known Nim game (Winning Ways

A Nim game played on graphs II

✍ Masahiko Fukuyama 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Note on a pursuit game played on graphs

✍ Thomas Andreae 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 337 KB

The domination game played on unions of

The domination game played on unions of graphs

✍ Dorbec, Paul; Košmrlj, Gašper; Renault, Gabriel 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A game of cops and robbers played on pro

A game of cops and robbers played on products of graphs

✍ S. Neufeld; R. Nowakowski 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 825 KB

The game of cops and robbers is played with a set of 'cops' and a 'robber' who occupy some vertices of a graph. Both sides have perfect information and they move alternately to adjacent vertices. The robber is captured if at least one of the cops occupies the same vertex as the robber. The problem i

Peg solitaire on graphs

✍ Robert A. Beeler; D. Paul Hoilman 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB