A note on \(k\)-cop, \(l\)-robber games on graphs

From MaRDI portal
Publication:2433710


DOI10.1016/j.disc.2005.12.038zbMath1201.91018MaRDI QIDQ2433710

Gary MacGillivray, Geňa Hahn

Publication date: 30 October 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.038


91A43: Games involving graphs

05C20: Directed graphs (digraphs), tournaments


Related Items

TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS, Cops and Robbers on Dynamic Graphs: Offline and Online Case, Fast Robber in Planar Graphs, Conjectures on Cops and Robbers, Cops and robber on some families of oriented graphs, Cops and robber on oriented graphs with respect to push operation, A game theoretic analysis of the cops and robber game, Cop vs. gambler, Simultaneously moving cops and robbers, Capturing the drunk robber on a graph, Characterizations of \(k\)-copwin graphs, Cops and robbers ordinals of cop-win trees, Selfish cops and passive robber: qualitative games, Cops and robbers from a distance, The capture time of grids, Guard games on graphs: keep the intruder out!, How to guard a graph?, Throttling for the game of cops and robbers on graphs, Linguistic geometry approach for solving the cops and robber problem in grid environments, General cops and robbers games with randomness, The role of information in the cop-robber game, An annotated bibliography on guaranteed graph searching, Cop-win graphs with maximum capture-time, A graph search algorithm for indoor pursuit/evasion, The capture time of a graph, Visibility graphs, dismantlability, and the cops and robbers game, Some remarks on cops and drunk robbers, Guarding a subgraph as a tool in pursuit-evasion games, Some game-theoretic remarks on two-player generalized cops and robbers games, Product throttling, On a contraction-like property of dismantlable graphs, Containment: a variation of cops and robber, The one-cop-moves game on graphs with some special structures, Cops and robbers is EXPTIME-complete, Pursuing a fast robber on a graph, A survey on the relationship between the game of cops and robbers and other game representations, The optimal capture time of the one-cop-moves game, Selfish cops and active robber: multi-player pursuit evasion on graphs, Variations on cops and robbers, A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity



Cites Work