Variations of cops and robber on the hypercube
From MaRDI portal
Recommendations
Cited in
(22)- Lazy cops and robbers on hypercubes
- The one-cop-moves game on graphs with some special structures
- Containment game played on random graphs: another zig-zag theorem
- Guarding isometric subgraphs and cops and robber in planar graphs
- Comparing the power of cops to zombies in pursuit-evasion games
- A cops and robber game in multidimensional grids
- A deterministic version of the game of zombies and survivors on graphs
- Variations of cops and robbers game on grids
- Variations of cops and robbers game on grids
- Guarding isometric subgraphs and lazy cops and robbers
- Parameterized analysis of the cops and robber problem
- The capture time of the hypercube
- Pursuit-evasion in graphs: zombies, lazy zombies and a survivor
- On the minimum order of 4-lazy cops-win graphs
- The one-cop-moves game on planar graphs
- A probabilistic version of the game of zombies and survivors on graphs
- Linguistic geometry approach for solving the cops and robber problem in grid environments
- Hunting rabbits on the hypercube
- An introduction to lazy cops and robbers on graphs
- Conjectures on cops and robbers
- Fully active cops and robbers
- Lazy Cops and Robbers on generalized hypercubes
This page was built for publication: Variations of cops and robber on the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876041)
