The game of overprescribed Cops and Robbers played on graphs

DOI10.1007/s00373-017-1815-2zbMath1371.05179arXiv1611.07592OpenAlexW2550070361WikidataQ57991413 ScholiaQ57991413MaRDI QIDQ2409518

Paweł Prałat, Benjamin Reiniger, Anthony Bonato, Xavier Pérez-Giménez

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.07592

zbMATH Keywords

random graphsplanar graphshypercubesCops and Robbersvertex pursuit games

Mathematics Subject Classification ID

Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Unnamed Item ⋮ The damage throttling number of a graph ⋮ Throttling for the game of cops and robbers on graphs ⋮ Bounds on the length of a game of cops and robbers ⋮ Product throttling ⋮ The localization capture time of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• The capture time of grids
• A game of cops and robbers
• Cop-win graphs with maximum capture-time
• The capture time of a graph
• On the cop number of a graph
• On a game of policemen and robber
• Vertex-to-vertex pursuit in a graph
• Cops and robbers in a random graph
• The capture time of the hypercube
• Meyniel's conjecture holds for random graphs
• Chasing robbers on random graphs: Zigzag theorem
• Pursuit-Evasion in Models of Complex Networks
• A separator theorem for graphs of bounded genus
• Planar Separators
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Characterizations and algorithms for generalized Cops and Robbers games

This page was built for publication: The game of overprescribed Cops and Robbers played on graphs