Cops and robber on some families of oriented graphs
From MaRDI portal
Publication:5896831
DOI10.1016/j.tcs.2021.07.016OpenAlexW4205967923MaRDI QIDQ5896831
Uma kant Sahoo, Sandip Das, Sagnik Sen, Harmender Gahlawat
Publication date: 27 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.016
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of pursuit on a graph
- Random graph coverings. I: General theory and graph connectivity
- Bounds on the length of a game of cops and robbers
- A game of cops and robbers
- On a pursuit game on Cayley digraphs
- Graph searching and a min-max theorem for tree-width
- On the cop number of a graph
- Game of cops and robbers in oriented quotients of the integer grid
- Vertex-to-vertex pursuit in a graph
- Cops and robbers on directed and undirected abelian Cayley graphs
- Cops and robbers on oriented toroidal grids
- Cops and robbers is EXPTIME-complete
- Topological directions in cops and robbers
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Variations on cops and robbers
- Cops and Robbers on Planar‐Directed Graphs
- The Cops and Robber game on graphs with forbidden (induced) subgraphs
- Randomized Pursuit-Evasion with Local Visibility
- Cops and robber on some families of oriented graphs
This page was built for publication: Cops and robber on some families of oriented graphs
