Hyperopic cops and robbers

DOI10.1016/j.tcs.2018.10.004zbMath1434.91015arXiv1710.10112OpenAlexW2963350743WikidataQ129132997 ScholiaQ129132997MaRDI QIDQ2328865

Yanyan Li

Publication date: 16 October 2019

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

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

zbMATH Keywords

planar graphsgraphscops and robberscop numbergraph densitiesinvisible robber

Mathematics Subject Classification ID

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

Related Items (1)

A note on hyperopic cops and robber

Cites Work

• A game of cops and robbers
• An annotated bibliography on guaranteed graph searching
• A witness version of the cops and robber game
• Cops and robbers in graphs with large girth and Cayley graphs
• Localization game on geometric and planar graphs
• A note on the localization number of random graphs: diameter two case
• Meyniel's conjecture on the cop number: a survey
• Cops and robbers is EXPTIME-complete
• On Meyniel's conjecture of the cop number
• Group chasing tactics: how to catch a faster prey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hyperopic cops and robbers