The game of Cops and Robber on circulant graphs
From MaRDI portal
(Redirected from Publication:528556)
Recommendations
Cites work
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 6470161 (Why is no real title available?)
- A game of cops and robbers
- A game of cops and robbers played on products of graphs
- A survey on multi-loop networks.
- Cops and robbers in a random graph
- Cops and robbers is EXPTIME-complete
- Efficient domination in circulant graphs
- On Meyniel's conjecture of the cop number
- On a pursuit game on Cayley graphs
- On the cop number of a graph
- On the domination number of the circulant graphs \(C(n;\{1,2\})\), \(C(n;\{1,3\})\) and \(C(n;\{1,4\})\).
- PRODUCTS OF CIRCULANT GRAPHS
- Tandem-win graphs
- The game of cops and robbers on graphs
- Vertex-to-vertex pursuit in a graph
Cited in
(8)- Generalized cops and robbers: a multi-player pursuit game on graphs
- On the Capture Time of Cops and Robbers Game on a Planar Graph
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Cops and Robbers on Graphs of Bounded Diameter
- The impact of loops on the game of cops and robbers on graphs
- Chasing a drunk robber in many classes of graphs
- TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS
- scientific article; zbMATH DE number 6820595 (Why is no real title available?)
This page was built for publication: The game of Cops and Robber on circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528556)