A note on k-cop, l-robber games on graphs

DOI10.1016/J.DISC.2005.12.038MaRDI QIDQ2433710zbMATH OpenOpenAlexFDO

Authors Geňa Hahn, Gary MacGillivray

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

\(k\)-cop-wincop-wincopnumberdigraphgraphpursuit

Mathematics Subject Classification ID

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

Recommendations

• Characterizations of k-copwin graphs
• scientific article; zbMATH DE number 5241699
• Characterizations and algorithms for generalized cops and robbers games
• A game of cops and robbers
• Cop and robber games when the robber can hide and ride

Cites work

• scientific article; zbMATH DE number 887776 (Why is no real title available?)
• scientific article; zbMATH DE number 2187680 (Why is no real title available?)
• On a pursuit game on Cayley digraphs
• On a pursuit game on Cayley graphs
• On bridged graphs and cop-win graphs
• On cop-win graphs
• The complexity of pursuit on a graph
• Vertex-to-vertex pursuit in a graph

Cited in

(47)

• The capture time of a graph
• Visibility graphs, dismantlability, and the cops and robbers game
• A note on \(k\)-cop-win graphs
• 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
• A faster algorithm for cops and robbers
• 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
• A game theoretic analysis of the cops and robber game
• Cop vs. gambler
• Variations on cops and robbers
• Large classes of infinite k-cop-win graphs
• Simultaneously moving cops and robbers
• A game of cops and robbers on graphs with periodic edge-connectivity
• Capturing the drunk robber on a graph
• Characterizations of k-copwin graphs
• Characterizations and algorithms for generalized cops and robbers games
• 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
• Cops and robbers ordinals of cop-win trees
• Selfish cops and passive robber: qualitative games
• Fast Robber in Planar Graphs
• Conjectures on cops and robbers
• Cops and robber on some families of oriented graphs
• Cops and robbers from a distance
• Cops and robber on oriented graphs with respect to push operation
• The capture time of grids
• Guard games on graphs: keep the intruder out!
• How to guard a graph?
• A cop and robber game on edge-periodic temporal graphs
• On cop-win dynamic graphs
• Pushing cops and robber on graphs of maximum degree four
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433710)