Fully active cops and robbers
Document Type
Article
Date of Original Version
1-1-2020
Abstract
We study a variation of the classical pursuit-evasion game of Cops and Robbers in which agents are required to move to an adjacent vertex on every turn. We explore how the minimum number of cops needed to catch the robber can change when this condition is added to the rules of the game. We study this “Fully Active Cops and Robbers” game for a number of classes of graphs and present some open problems for future research.
Publication Title, e.g., Journal
Australasian Journal of Combinatorics
Volume
76
Issue
2
Citation/Publisher Attribution
Gromovikov, Ilya, William B. Kinnersley, and Ben Seamone. "Fully active cops and robbers." Australasian Journal of Combinatorics 76, 2 (2020): 248-265. https://digitalcommons.uri.edu/math_facpubs/139
COinS