Limited visibility cops and robber

DOI10.1016/j.dam.2019.12.007zbMath1441.05155arXiv1708.07179OpenAlexW2997427396MaRDI QIDQ2185730

Yanyan Li

Publication date: 5 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

chordal graphsgraph searchingcops and robber

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Computing the one-visibility cop-win strategies for trees ⋮ The one-visibility localization game ⋮ A note on hyperopic cops and robber ⋮ One-visibility cops and robber on trees ⋮ Computing the one-visibility copnumber of trees ⋮ One-visibility cops and robber on trees: optimal cop-win strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A deterministic version of the game of zombies and survivors on graphs
• A probabilistic version of the game of zombies and survivors on graphs
• Cops and invisible robbers: the cost of drunkenness
• Characterizations of \(k\)-copwin graphs
• How to hunt an invisible rabbit on a graph
• The complexity of zero-visibility cops and robber
• On the cop number of a graph
• Vertex-to-vertex pursuit in a graph
• On a class of isometric subgraphs of a graph
• On cop-win graphs
• Zero-visibility cops and robber and the pathwidth of a graph
• Tandem-win graphs
• Asymmetric graphs

This page was built for publication: Limited visibility cops and robber