One-visibility cops and robber on trees: optimal cop-win strategies
From MaRDI portal
Publication:2079862
DOI10.1016/j.tcs.2022.06.011MaRDI QIDQ2079862
Publication date: 7 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.011
68Qxx: Theory of computing
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On minimizing width in linear layouts
- The complexity of zero-visibility cops and robber
- Graph searching and a min-max theorem for tree-width
- Tree-width, path-width, and cutwidth
- Searching and pebbling
- Vertex-to-vertex pursuit in a graph
- Limited visibility cops and robber
- One-visibility cops and robber on trees
- A partition approach to lower bounds for zero-visibility cops and robber
- Zero-visibility cops and robber and the pathwidth of a graph
- The complexity of searching a graph