On the cop number of a graph
From MaRDI portal
Publication:1325748
DOI10.1006/aama.1993.1019zbMath0801.90150OpenAlexW1996456693MaRDI QIDQ1325748
Alessandro Berarducci, Benedetto Intrigila
Publication date: 3 July 1994
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1993.1019
Games involving graphs (91A43) Graph theory (05C99) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)
Related Items (48)
Cop vs. gambler ⋮ Variations on cops and robbers ⋮ Cops and robber on butterflies and solid grids ⋮ Fast Robber in Planar Graphs ⋮ On Meyniel's conjecture of the cop number ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS ⋮ On Strict (Outer-)Confluent Graphs ⋮ Cops and an insightful robber ⋮ Containment: a variation of cops and robber ⋮ Cops and robbers from a distance ⋮ The game of overprescribed Cops and Robbers played on graphs ⋮ Limited visibility cops and robber ⋮ Helicopter search problems, bandwidth and pathwidth ⋮ Cops and Robbers on Dynamic Graphs: Offline and Online Case ⋮ Capturing the drunk robber on a graph ⋮ Characterizations of \(k\)-copwin graphs ⋮ On the zombie number of various graph classes ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ A tight lower bound for the capture time of the cops and robbers game ⋮ Cops and robbers on graphs with a set of forbidden induced subgraphs ⋮ Cops that surround a robber ⋮ A note on hyperopic cops and robber ⋮ Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs ⋮ Cops and robber on subclasses of \(P_5\)-free graphs ⋮ The one-cop-moves game on graphs with some special structures ⋮ A note on the cops and robber game on graphs embedded in non-orientable surfaces ⋮ Guard games on graphs: keep the intruder out! ⋮ How to guard a graph? ⋮ An annotated bibliography on guaranteed graph searching ⋮ A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity ⋮ Fine-grained Lower Bounds on Cops and Robbers ⋮ Cops and robber on some families of oriented graphs ⋮ Cops and robbers on \(2K_2\)-free graphs ⋮ The game of Cops and Robber on circulant graphs ⋮ Selfish cops and passive robber: qualitative games ⋮ Cops and robbers is EXPTIME-complete ⋮ Pursuing a fast robber on a graph ⋮ Throttling for the game of cops and robbers on graphs ⋮ Bounds on the length of a game of cops and robbers ⋮ Large classes of infinite k-cop-win graphs ⋮ 4-cop-win graphs have at least 19 vertices ⋮ Some game-theoretic remarks on two-player generalized cops and robbers games ⋮ A two-person game on graphs where each player tries to encircle his opponent's men ⋮ 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 localization capture time of a graph
This page was built for publication: On the cop number of a graph
