Pursuit evasion on infinite graphs

DOI10.1016/j.tcs.2016.04.024zbMath1353.05086arXiv1410.8412OpenAlexW2345951484MaRDI QIDQ343924

Florian Lehner

Publication date: 29 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

infinite graphscops and robberspursuit evasion

Mathematics Subject Classification ID

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

Related Items (1)

Constructible graphs and pursuit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The capture time of a graph
• On constructible graphs, infinite bridged graphs and weakly cop-win graphs
• Vertex-to-vertex pursuit in a graph
• On cop-win graphs
• On infinite bridged graphs and strongly dismantlable graphs
• Large classes of infinite k-cop-win graphs
• Cop and Robber Games When the Robber Can Hide and Ride
• Retract‐collapsible graphs and invariant subgraph properties
• On constructible graphs, locally Helly graphs, and convexity

This page was built for publication: Pursuit evasion on infinite graphs