A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity

DOI10.1007/978-3-030-38919-2_6zbMath1446.91026arXiv1908.06828OpenAlexW3004233128MaRDI QIDQ3297755

Jakob T. Spooner, Erlebach, Thomas

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

cops and robberscombinatorial gamegame on graphsreachability games

Mathematics Subject Classification ID

Games involving graphs (91A43) Dynamic games (91A25) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ Cops and Robbers on Dynamic Graphs: Offline and Online Case ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• Graph searching and a min-max theorem for tree-width
• On the cop number of a graph
• Vertex-to-vertex pursuit in a graph
• Automata, logics, and infinite games. A guide to current research
• A note on \(k\)-cop, \(l\)-robber games on graphs
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*

This page was built for publication: A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity