Lazy Cops and Robbers on Hypercubes

DOI10.1017/S0963548314000807zbMath1371.05178MaRDI QIDQ5364259

Deepak Bal, Anthony Bonato, William B. Kinnersley, Paweł Prałat

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (11)

A probabilistic version of the game of zombies and survivors on graphs ⋮ Catching an infinitely fast robber on a grid ⋮ An Introduction to Lazy Cops and Robbers on Graphs ⋮ The one-cop-moves game on graphs with some special structures ⋮ Lazy Cops and Robbers on generalized hypercubes ⋮ Fully Active Cops and Robbers ⋮ Variations of cops and robbers game on grids ⋮ The one-cop-moves game on planar graphs ⋮ Linguistic geometry approach for solving the cops and robber problem in grid environments ⋮ Conjectures on Cops and Robbers ⋮ Containment game played on random graphs: another zig-zag theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Cops and invisible robbers: the cost of drunkenness
• Cops and robbers from a distance
• A game of cops and robbers
• Vertex-to-vertex pursuit in a graph
• Some remarks on cops and drunk robbers
• Meyniel's conjecture on the cop number: a survey
• Cops and robbers playing on edges
• Variations on cops and robbers
• Chasing a Fast Robber on Planar Graphs and Random Graphs
• Pursuit and evasion from a distance: algorithms and bounds
• WHAT IS...Cop Number?

This page was built for publication: Lazy Cops and Robbers on Hypercubes