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

DOI10.1016/j.disc.2005.12.038zbMath1201.91018OpenAlexW2012220350MaRDI 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

zbMATH Keywords

graphdigraphpursuitcopnumber\(k\)-cop-wincop-win

Mathematics Subject Classification ID

Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20)

Related Items (40)

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

Cites Work

• The complexity of pursuit on a graph
• On a pursuit game on Cayley graphs
• On a pursuit game on Cayley digraphs
• On bridged graphs and cop-win graphs
• Vertex-to-vertex pursuit in a graph
• On cop-win graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on \(k\)-cop, \(l\)-robber games on graphs