A game of cops and robbers

DOI10.1016/0166-218X(84)90073-8zbMATH Open0539.05052OpenAlexW2046635105MaRDI QIDQ793755FDOQ793755

Authors: Martin Aigner, M. Fromme 

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90073-8

Recommendations

• scientific article; zbMATH DE number 5241699
• Note on a pursuit game played on graphs
• scientific article; zbMATH DE number 4064802
• Cops and Robbers on Planar‐Directed Graphs
• On the cop number of a graph

zbMATH Keywords

cop numbergame on graphs

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Structural characterization of families of graphs (05C75) Positional games (pursuit and evasion, etc.) (91A24)

Cites Work

• Vertex-to-vertex pursuit in a graph
• Title not available (Why is that?)
• Parallel concepts in graph theory
• Title not available (Why is that?)
• Some results about pursuit games on metric spaces obtained through graph theory techniques
• The smallest graph variety containing all paths
• Graphs and composite games

Cited In (only showing first 100 items - show all)

• General cops and robbers games with randomness
• A simple approach for lower-bounding the distortion in any hyperbolic embedding
• The optimal capture time of the one-cop-moves game
• An extension of a fixed point problem for simple graphs
• On the cop number of generalized Petersen graphs
• Vertex Pursuit Games in Stochastic Network Models
• Isometric-path numbers of block graphs
• On a pursuit game on Cayley digraphs
• Localization game on geometric and planar graphs
• On strict (outer-)confluent graphs
• On strict (outer-)confluent graphs
• The capture time of a planar graph
• Throttling for the game of cops and robbers on graphs
• A two-person game on graphs where each player tries to encircle his opponent's men
• Fine-grained Lower Bounds on Cops and Robbers
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
• The lion and man game on polyhedral surfaces with obstacles
• A cops and robber game in multidimensional grids
• Bounds on the length of a game of cops and robbers
• Variations of cops and robbers game on grids
• Note on a pursuit game played on graphs
• Chasing robbers on random geometric graphs-an alternative approach
• Cops and robber on butterflies and solid grids
• Cop-Robber Guarding Game with Cycle Robber Region
• Coarse geometry of the cops and robber game
• Visibility graphs, dismantlability, and the cops and robbers game
• Ambush cops and robbers
• Lower bounds for the capture time: linear, quadratic, and beyond
• Cops and robbers on intersection graphs
• How many ants does it take to find the food?
• The capture time of the hypercube
• Cops and robber game without recharging
• A note on the cops and robber game on graphs embedded in non-orientable surfaces
• Title not available (Why is that?)
• Linguistic geometry approach for solving the cops and robber problem in grid environments
• The game of overprescribed Cops and Robbers played on graphs
• Cops and robbers on geometric graphs
• Isometric path numbers of graphs
• On the generalised colouring numbers of graphs that exclude a fixed minor
• Finding cut-vertices in the square roots of a graph
• Escaping offline searchers and isoperimetric theorems
• Bounds for cops and robber pursuit
• Conjectures on cops and robbers
• On the Capture Time of Cops and Robbers Game on a Planar Graph
• On a contraction-like property of dismantlable graphs
• A simple method for proving lower bounds in the zero-visibility cops and robber game
• Search and sweep numbers of finite directed acyclic graphs
• Zero-visibility cops and robber and the pathwidth of a graph
• Edge-critical cops and robber in planar graphs
• On colourability of polygon visibility graphs
• Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
• The one-cop-moves game on graphs with some special structures
• Cops and robbers on \(2K_2\)-free graphs
• Study of a combinatorial game in graphs through linear programming
• Study of a combinatorial game in graphs through linear programming
• An application of the Gyárfás path argument
• The game of cops and robbers on directed graphs with forbidden subgraphs
• Title not available (Why is that?)
• Chasing a drunk robber in many classes of graphs
• Fast Robber in Planar Graphs
• Meyniel extremal families of abelian Cayley graphs
• A tight lower bound for the capture time of the cops and robbers game
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• Comparing the power of cops to zombies in pursuit-evasion games
• Cops and Robbers on Dynamic Graphs: Offline and Online Case
• Spy-game on graphs: complexity and simple topologies
• The median game
• On the conjecture of the smallest 3-cop-win planar graph
• Even flying cops should think ahead
• The cops and robber game on graphs with forbidden (induced) subgraphs
• Cops and robbers on directed and undirected abelian Cayley graphs
• A faster algorithm for cops and robbers
• Catching an infinitely fast robber on a grid
• The one-cop-moves game on planar graphs
• Containment: a variation of cops and robber
• Cops and robber on some families of oriented graphs
• A uniform betweenness property in metric spaces and its role in the quantitative analysis of the ``lion-man game
• Guarding a subgraph as a tool in pursuit-evasion games
• An introduction to lazy cops and robbers on graphs
• On a characterization of evasion strategies for pursuit-evasion games on graphs
• A note on hyperopic cops and robber
• A survey on the relationship between the game of cops and robbers and other game representations
• Product throttling
• Cops and robbers on graphs with a set of forbidden induced subgraphs
• Edge degeneracy: algorithmic and structural results
• Cops that surround a robber
• The cop number of the one-cop-moves game on planar graphs
• The impact of loops on the game of cops and robbers on graphs
• On positionality of trigger strategies Nash equilibria in SCAR
• Fully active cops and robbers
• A note on cops and robbers, independence number, domination number and diameter
• A game of cops and robbers on graphs with periodic edge-connectivity
• \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas
• Cop-robber guarding game with cycle robber-region
• Guard games on graphs: keep the intruder out!
• How to guard a graph?
• The complexity of pursuit on a graph
• To catch a falling robber
• The role of information in the cop-robber game

This page was built for publication: A game of cops and robbers

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