Topological directions in cops and robbers
From MaRDI portal
Publication:2335907
DOI10.4310/JOC.2020.V11.N1.A3zbMath1427.05144arXiv1709.09050WikidataQ127198452 ScholiaQ127198452MaRDI QIDQ2335907
Publication date: 18 November 2019
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.09050
Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (8)
A simple method for proving lower bounds in the zero-visibility cops and robber game ⋮ The node cop‐win reliability of unicyclic and bicyclic graphs ⋮ The localization number of designs ⋮ Cops and robber on some families of oriented graphs ⋮ On the cop number of toroidal graphs ⋮ Bounding the Cop Number of a Graph by Its Genus ⋮ 4-cop-win graphs have at least 19 vertices ⋮ The game of cops and eternal robbers
This page was built for publication: Topological directions in cops and robbers
