Recommendations
Cites work
- A game of cops and robbers
- Chasing a fast robber on planar graphs and random graphs
- Cops and invisible robbers: the cost of drunkenness
- Cops and robbers from a distance
- Cops and robbers playing on edges
- Meyniel's conjecture on the cop number: a survey
- Pursuit and evasion from a distance: algorithms and bounds
- Some remarks on cops and drunk robbers
- The game of cops and robbers on graphs
- Variations of cops and robber on the hypercube
- Variations on cops and robbers
- Vertex-to-vertex pursuit in a graph
- WHAT IS...Cop Number?
Cited in
(19)- The one-cop-moves game on planar graphs
- Catching an infinitely fast robber on a grid
- The one-cop-moves game on graphs with some special structures
- Containment game played on random graphs: another zig-zag theorem
- Variations of cops and robber on the hypercube
- A probabilistic version of the game of zombies and survivors on graphs
- Lazy cops and robbers played on random graphs and graphs on surfaces
- An introduction to lazy cops and robbers on graphs
- Fully active cops and robbers
- Lazy Cops and Robbers on generalized hypercubes
- Conjectures on cops and robbers
- Connected Search for a Lazy Robber
- Variations of cops and robbers game on grids
- Variations of cops and robbers game on grids
- Connected search for a lazy robber
- Guarding isometric subgraphs and cops and robber in planar graphs
- Guarding isometric subgraphs and lazy cops and robbers
- Pursuit-evasion in graphs: zombies, lazy zombies and a survivor
- Linguistic geometry approach for solving the cops and robber problem in grid environments
This page was built for publication: Lazy cops and robbers on hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364259)