Cops and Robber game with a fast robber on expander graphs and random graphs
From MaRDI portal
Publication:1929738
DOI10.1007/s00026-012-0163-4zbMath1256.05151arXiv1105.2851OpenAlexW1967512075MaRDI QIDQ1929738
Publication date: 9 January 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.2851
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 (4)
Catching an infinitely fast robber on a grid ⋮ Chasing a Fast Robber on Planar Graphs and Random Graphs ⋮ The fast robber on interval and chordal graphs ⋮ Cops, a fast robber and defensive domination on interval graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cops and robbers from a distance
- A witness version of the cops and robber game
- Cops and robbers in graphs with large girth and Cayley graphs
- The isoperimetric number of random regular graphs
- Graph searching and a min-max theorem for tree-width
- The bisection width and the isoperimetric number of arrays.
- A game of cops and robbers played on products of graphs
- Vertex-to-vertex pursuit in a graph
- Cops and robbers in a random graph
- Pursuing a fast robber on a graph
- Meyniel's conjecture holds for random graphs
- Variations on cops and robbers
- On Meyniel's conjecture of the cop number
- Chasing a Fast Robber on Planar Graphs and Random Graphs
- Chasing robbers on random graphs: Zigzag theorem
- A Bound for the Cops and Robbers Problem
- Expander graphs and their applications
- Isoperimetric Inequalities for Cartesian Products of Graphs
- Randomized Pursuit-Evasion with Local Visibility
- On the domination number of a random graph
This page was built for publication: Cops and Robber game with a fast robber on expander graphs and random graphs
