Characterizations and algorithms for generalized Cops and Robbers games

zbMath1376.05087arXiv1704.05655MaRDI QIDQ4598355

Gary MacGillivray, Anthony Bonato

Publication date: 20 December 2017

Full work available at URL: https://arxiv.org/abs/1704.05655

zbMATH Keywords

directed graphscops and robbersrelational characterizationvertex elimination ordering

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (14)

General cops and robbers games with randomness ⋮ Simultaneously moving cops and robbers ⋮ A simple method for proving lower bounds in the zero-visibility cops and robber game ⋮ The game of overprescribed Cops and Robbers played on graphs ⋮ Cops and Robbers on Dynamic Graphs: Offline and Online Case ⋮ Selfish cops and active robber: multi-player pursuit evasion on graphs ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Cops and robbers ordinals of cop-win trees ⋮ Selfish cops and passive robber: qualitative games ⋮ A survey on the relationship between the game of cops and robbers and other game representations ⋮ Generalized cops and robbers: a multi-player pursuit game on graphs ⋮ The one-cop-moves game on planar graphs ⋮ Some game-theoretic remarks on two-player generalized cops and robbers games ⋮ The optimal capture time of the one-cop-moves game

This page was built for publication: Characterizations and algorithms for generalized Cops and Robbers games