The zero-visibility cops and robber game on graph products

DOI10.1016/J.TCS.2024.114676MaRDI QIDQ6564028FDOQ6564028

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

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

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)