Subdivisions in the robber locating game

DOI10.1016/j.disc.2016.05.024zbMath1339.05254arXiv1509.04701OpenAlexW2951735999MaRDI QIDQ2629293

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

Publication date: 5 July 2016

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

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

zbMATH Keywords

subdivisioncops and robbersgraph searching

Mathematics Subject Classification ID

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

Related Items (2)

A robber locating strategy for trees ⋮ Locating a robber with multiple probes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An evasion game on a graph
• The robber locating game
• 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

This page was built for publication: Subdivisions in the robber locating game