Containment: a variation of cops and robber
From MaRDI portal
Publication:2175792
DOI10.1007/s00373-020-02140-5zbMath1439.05152arXiv1405.3330OpenAlexW3007271358MaRDI QIDQ2175792
John Mackey, Danny Crytser, Natasha Komarov
Publication date: 30 April 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.3330
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (3)
Cops that surround a robber ⋮ Unnamed Item ⋮ Containment game played on random graphs: another zig-zag theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Characterizations of \(k\)-copwin graphs
- Regular graphs of large girth and arbitrary degree
- A game of cops and robbers
- The capture time of a graph
- The sextet construction for cubic graphs
- Girths of bipartite sextet graphs
- Cops and robbers in graphs with large girth and Cayley graphs
- Constructions for cubic graphs with large girth
- On the cop number of a graph
- On a game of policemen and robber
- Vertex-to-vertex pursuit in a graph
- On cop-win graphs
- Containment game played on random graphs: another zig-zag theorem
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Cops and robbers playing on edges
- On Meyniel's conjecture of the cop number
- Maximum hitting time for random walks on graphs
This page was built for publication: Containment: a variation of cops and robber