𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on -cop, -robber games on graphs

✍ Scribed by Geňa Hahn; Gary MacGillivray

Book ID
108113627
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
186 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A game of cops and robbers
A game of cops and robbers
✍ M. Aigner; M. Fromme 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 632 KB
Variations on cops and robbers
Variations on cops and robbers
✍ Alan Frieze; Michael Krivelevich; Po-Shen Loh 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

## Abstract We consider several variants of the classical Cops and Robbers game. We treat the version where the robber can move __R__≥1 edges at a time, establishing a general upper bound of , where α = 1 + 1/__R__, thus generalizing the best known upper bound for the classical case __R__ = 1 due t

A note concerning asymmetric games on gr
A note concerning asymmetric games on graphs
✍ Alvin E. Roth 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract We consider a class of asymmetric two‐person games played on graphs, and characterize all the positions in the game.