Lazy Cops and Robbers on generalized hypercubes
From MaRDI portal
(Redirected from Publication:526267)
Recommendations
Cites work
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- A game of cops and robbers
- Combinatorial properties of generalized hypercube graphs
- Cops and robbers in graphs with large girth and Cayley graphs
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Lazy cops and robbers on hypercubes
- Lazy cops and robbers played on random graphs and graphs on surfaces
- The game of cops and robbers on graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Two characterizations of generalized hypercube
- Variations of cops and robber on the hypercube
- Vertex-to-vertex pursuit in a graph
Cited in
(7)- Lazy cops and robbers played on random graphs and graphs on surfaces
- The one-cop-moves game on planar graphs
- Connected Search for a Lazy Robber
- Connected search for a lazy robber
- Lazy cops and robbers on hypercubes
- On the minimum order of 4-lazy cops-win graphs
- Variations of cops and robbers game on grids
This page was built for publication: Lazy Cops and Robbers on generalized hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526267)