To catch a falling robber

DOI10.1016/j.tcs.2016.02.030zbMath1338.91033arXiv1406.2228OpenAlexW2267246357MaRDI QIDQ265090

Paweł Prałat, Douglas B. West, William B. Kinnersley

Publication date: 1 April 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

hypercube\(n\)-dimensional cubecop numbercops-and-robber game

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• Cops and robbers in graphs with large girth and Cayley graphs
• On a game of policemen and robber
• 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
• A Bound for the Cops and Robbers Problem