Locating a robber on a graph
From MaRDI portal
Recommendations
Cites work
- A sequential locating game on graphs
- An annotated bibliography on guaranteed graph searching
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- 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
(31)- Localization game on geometric and planar graphs
- Approximately locating an invisible agent in a graph with relative distance queries
- The cat and the noisy mouse
- A note on the localization number of random graphs: diameter two case
- Locating a robber on a graph via distance queries
- Localization game for random graphs
- Localization game for random geometric graphs
- The localization capture time of a graph
- On the status sequences of trees
- The localization game on Cartesian products
- A robber locating strategy for trees
- Locating a robber with multiple probes
- Locating a backtracking robber on a tree
- Subdivisions in the robber locating game
- A sequential locating game on graphs
- An evasion game on a graph
- The robber locating game
- Connected Search for a Lazy Robber
- Sequential metric dimension
- The one-visibility localization game
- Connected search for a lazy robber
- The localization game on oriented graphs
- scientific article; zbMATH DE number 7720720 (Why is no real title available?)
- The localization number of designs
- Centroidal localization game
- A note on robber locating game
- Runner locating with multiple probes
- Cuts, cats, and complete graphs
- The localization game on locally finite trees (extended abstract)
- Lower bounds of location numbers
- Localization game capture time of trees and outerplanar graphs
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)