The following pages link to Locating a robber on a graph (Q713142):
Displaying 21 items.
- An evasion game on a graph (Q383337) (← links)
- The robber locating game (Q501037) (← links)
- Centroidal localization game (Q668034) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Approximately locating an invisible agent in a graph with relative distance queries (Q1637147) (← links)
- The cat and the noisy mouse (Q1699546) (← links)
- A note on the localization number of random graphs: diameter two case (Q1720315) (← links)
- Locating a robber on a graph via distance queries (Q1929218) (← links)
- Localization game for random graphs (Q2065786) (← links)
- Localization game for random geometric graphs (Q2107488) (← links)
- The localization capture time of a graph (Q2118876) (← links)
- On the status sequences of trees (Q2219062) (← links)
- The localization game on Cartesian products (Q2235282) (← links)
- A robber locating strategy for trees (Q2410225) (← links)
- Locating a robber with multiple probes (Q2411615) (← links)
- Locating a backtracking robber on a tree (Q2453120) (← links)
- Subdivisions in the robber locating game (Q2629293) (← links)
- Sequential metric dimension (Q5918179) (← links)
- The one-visibility localization game (Q6073890) (← links)
- The localization game on oriented graphs (Q6110602) (← links)
- The localization number of designs (Q6188118) (← links)
