Constructible graphs and pursuit

DOI10.1016/J.TCS.2022.07.023MaRDI QIDQ2166777zbMATH OpenOpenAlexFDO

Authors Maria-Romina Ivan, Imre Leader, Mark Walters

Publication date 25 August 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

cops and robbersinfinite graphspursuit

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Pursuit evasion on infinite graphs
• On constructible graphs, infinite bridged graphs and weakly cop-win graphs
• On cop-win graphs
• Large classes of infinite k-cop-win graphs
• A game of cops and robbers

Cites work

• On constructible graphs, infinite bridged graphs and weakly cop-win graphs
• On constructible graphs, locally Helly graphs, and convexity
• On cop-win graphs
• On infinite bridged graphs and strongly dismantlable graphs
• Pursuit evasion on infinite graphs
• Randomized pursuit-evasion with limited visibility
• Retract‐collapsible graphs and invariant subgraph properties
• The capture time of a graph
• The game of cops and robbers on graphs
• Vertex-to-vertex pursuit in a graph

Cited in

(5)

• scientific article; zbMATH DE number 1205986 (Why is no real title available?)
• Constructible Graphs and Pursuit
• All ordinals are cop-robber ordinals
• The localization game on locally finite trees (extended abstract)
• Dominating orders, vertex pursuit games, and computability theory

This page was built for publication: Constructible graphs and pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166777)