Locating a robber on a graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- A sequential locating game on graphs
- An annotated bibliography on guaranteed graph searching
- Locating a robber on a graph via distance queries
- On the Metric Dimension of Cartesian Products of Graphs
- Vertex-to-vertex pursuit in a graph
Cited in
(25)- Approximately locating an invisible agent in a graph with relative distance queries
- The localization game on oriented graphs
- The localization game on Cartesian products
- The localization capture time of a graph
- Locating a robber with multiple probes
- On the status sequences of trees
- Locating a robber on a graph via distance queries
- Connected Search for a Lazy Robber
- Connected search for a lazy robber
- scientific article; zbMATH DE number 7720720 (Why is no real title available?)
- An evasion game on a graph
- The cat and the noisy mouse
- Centroidal localization game
- Localization game on geometric and planar graphs
- A note on the localization number of random graphs: diameter two case
- Localization game for random graphs
- Locating a backtracking robber on a tree
- Subdivisions in the robber locating game
- Localization game for random geometric graphs
- The robber locating game
- A sequential locating game on graphs
- Sequential metric dimension
- A robber locating strategy for trees
- The localization number of designs
- The one-visibility localization game
This page was built for publication: Locating a robber on a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713142)