How to hunt an invisible rabbit on a graph

DOI10.1016/j.ejc.2015.08.002zbMath1327.05233arXiv1502.05614OpenAlexW1855571088WikidataQ60488376 ScholiaQ60488376MaRDI QIDQ896060

Tatjana V. Abramovskaya, Michał Pilipczuk, Fedor V. Fomin, Petr A. Golovach

Publication date: 11 December 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Hunters \& Rabbit game

Mathematics Subject Classification ID

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

Related Items (5)

Hunting rabbits on the hypercube ⋮ Searching for an intruder on graphs and their subdivisions ⋮ A competitive search game with a moving target ⋮ Limited visibility cops and robber ⋮ On Evasion Games on Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An evasion game on a graph
• An annotated bibliography on guaranteed graph searching
• Escaping offline searchers and isoperimetric theorems
• Interval graphs and searching
• A short note about pursuit games played on a graph with a given genus
• The vertex separation and search number of a graph
• Searching and pebbling
• Vertex-to-vertex pursuit in a graph
• Finding a princess in a palace: a pursuit-evasion problem
• Randomized Pursuit-Evasion in Graphs

This page was built for publication: How to hunt an invisible rabbit on a graph