Cops and robber -- when capturing is not surrounding

DOI10.37236/13508MaRDI QIDQ6925685zbMATH OpenFDO

Authors Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt

Publication date 25 September 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13508

zbMATH Keywords

containmentcop numberpursuit games

Mathematics Subject Classification ID

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

Cites work

• A game of cops and robbers
• An invitation to pursuit-evasion games and graph theory
• Containment game played on random graphs: another zig-zag theorem
• Containment: a variation of cops and robber
• Cops and Robber -- When Capturing is not Surrounding
• Cops and robbers in graphs with large girth and Cayley graphs
• Cops and robbers is EXPTIME-complete
• Cops that surround a robber
• scientific article; zbMATH DE number 6473829 (Why is no real title available?)
• Primal-dual cops and robber
• The game of cops and robbers on graphs
• Vertex-to-vertex pursuit in a graph

This page was built for publication: Cops and robber -- when capturing is not surrounding

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