✦ LIBER ✦

Cops and Robbers on Graphs Based on Designs

✍ Scribed by Bonato, Anthony; Burgess, Andrea

Book ID: 120593852
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 169 KB
Volume: 21
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.21331

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on -cop, -robber games on graphs

✍ Geňa Hahn; Gary MacGillivray 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Cops and Robber Game with a Fast Robber

Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs

✍ Abbas Mehrabian 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 326 KB

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 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

Cops and robbers in graphs with large gi

Cops and robbers in graphs with large girth and Cayley graphs

✍ Peter Frankl 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Cops and robbers in a random graph

✍ Bollobás, Béla; Kun, Gábor; Leader, Imre 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 201 KB