The robber locating game

DOI10.1016/j.disc.2015.07.018zbMath1322.05095arXiv1311.3867OpenAlexW2949940531MaRDI QIDQ501037

John Haslegrave, Richard A. B. Johnson, Sebastian Koch

Publication date: 8 October 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.3867

zbMATH Keywords

subdivisioncops and robbersgraph searching

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Subdivisions in the robber locating game, Approximately locating an invisible agent in a graph with relative distance queries, A robber locating strategy for trees, Locating a robber with multiple probes, The cat and the noisy mouse

Cites Work

• An evasion game on a graph
• Locating a robber on a graph
• A game of cops and robbers
• Cops and robbers in graphs with large girth and Cayley graphs
• Vertex-to-vertex pursuit in a graph
• Locating a robber on a graph via distance queries
• Cops and robbers in a random graph
• Locating a backtracking robber on a tree
• Chasing robbers on random graphs: Zigzag theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item