New results on the zero-visibility cops and robber game

DOI10.1007/978-3-030-27195-4_29MaRDI QIDQ6199026zbMATH OpenOpenAlexFDO

Authors Yuan Xue, Boting Yang, Sandra Zilles

Publication date 23 February 2024

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-27195-4_29

Mathematics Subject Classification ID

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

Recommendations

• A simple method for proving lower bounds in the zero-visibility cops and robber game
• A partition approach to lower bounds for zero-visibility cops and robber
• Zero-visibility cops and robber game on a graph
• Zero-visibility cops and robber and the pathwidth of a graph
• The complexity of zero-visibility cops and robber

Cited in

(1)

• Computing the one-visibility copnumber of trees

This page was built for publication: New results on the zero-visibility cops and robber game

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