Constructible graphs and pursuit

DOI10.1016/j.tcs.2022.07.023OpenAlexW4288740300MaRDI QIDQ2166777

Imre Leader, Maria-Romina Ivan, Mark Walters

Publication date: 25 August 2022

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

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

zbMATH Keywords

infinite graphscops and robberspursuit

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Pursuit evasion on infinite graphs
• 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
• Retract‐collapsible graphs and invariant subgraph properties
• On constructible graphs, locally Helly graphs, and convexity

This page was built for publication: Constructible graphs and pursuit