Computing the one-visibility copnumber of trees
From MaRDI portal
Publication:2039691
DOI10.1007/978-3-030-57602-8_37zbMath1482.05325MaRDI QIDQ2039691
Publication date: 5 July 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_37
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of zero-visibility cops and robber
- Vertex-to-vertex pursuit in a graph
- Limited visibility cops and robber
- 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
- New results on the zero-visibility cops and robber game