Chasing robbers on random geometric graphs-an alternative approach

DOI10.1016/j.dam.2014.06.004zbMath1300.05176arXiv1401.3313OpenAlexW2069386249MaRDI QIDQ741544

Noga Alon, Paweł Prałat

Publication date: 12 September 2014

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

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

zbMATH Keywords

random graphscops and robbersvertex-pursuit games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

On the contractibility of random Vietoris-Rips complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a generalization of Meyniel's conjecture on the Cops and Robbers game
• A game of cops and robbers
• An annotated bibliography on guaranteed graph searching
• A framework for pursuit evasion games in
• Cops and robbers in graphs with large girth and Cayley graphs
• Vertex-to-vertex pursuit in a graph
• Cops and robbers in a random graph
• Meyniel's conjecture holds for random graphs
• Variations on cops and robbers
• On Meyniel's conjecture of the cop number
• Chasing robbers on random graphs: Zigzag theorem
• Pursuit-Evasion in Models of Complex Networks
• Cops and Robbers on Geometric Graphs
• A Bound for the Cops and Robbers Problem
• Random Geometric Graphs
• A better bound for the cop number of general graphs
• Solution of David Gale's lion and man problem

This page was built for publication: Chasing robbers on random geometric graphs-an alternative approach