The zero-visibility cops and robber game on graph products

DOI10.1016/J.TCS.2024.114676MaRDI QIDQ6564028zbMATH OpenFDO

Authors Yuan Xue, Boting Yang, Sandra Zilles

Publication date 28 June 2024

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

zbMATH Keywords

pursuit and evasion gamecops and robbers gamezero-visibility cops and robber game

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3997549 (Why is no real title available?)
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• A game of cops and robbers played on products of graphs
• A simple method for proving lower bounds in the zero-visibility cops and robber game
• Cops and invisible robbers: the cost of drunkenness
• Limited visibility cops and robber
• Lower bounds on the pathwidth of some grid-like graphs
• Monotonicity in digraph search problems
• Monotonicity in graph searching
• Monotonicity of strong searching on digraphs
• On a game of policemen and robber
• One-visibility cops and robber on trees: optimal cop-win strategies
• Recontamination does not help to search a graph
• Some remarks on cops and drunk robbers
• The complexity of searching a graph
• The complexity of zero-visibility cops and robber
• The game of cops and robbers on graphs
• The treewidth and pathwidth of hypercubes
• Vertex-to-vertex pursuit in a graph
• Zero-visibility cops and robber and the pathwidth of a graph

This page was built for publication: The zero-visibility cops and robber game on graph products

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