Cops and robber on butterflies, grids, and AT-free graphs
From MaRDI portal
Publication:6145827
DOI10.1016/j.dam.2023.12.009zbMath1530.91069MaRDI QIDQ6145827
Sheikh Shakil Akhtar, Harmender Gahlawat, Sandip Das
Publication date: 9 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- A cops and robber game in multidimensional grids
- The capture time of grids
- A game of cops and robbers
- On the cop number of a graph
- A game of cops and robbers played on products of graphs
- Cops and robbers on intersection graphs
- On a game of policemen and robber
- Vertex-to-vertex pursuit in a graph
- On the computational complexity of a game of cops and robbers
- On the cop number of toroidal graphs
- A tight lower bound for the capture time of the cops and robbers game
- Cops that surround a robber
- Cops and robbers is EXPTIME-complete
- Pursuing a fast robber on a graph
- Cops, a fast robber and defensive domination on interval graphs
- Catching a fast robber on the grid
- Variations on cops and robbers
- Cop and Robber Games When the Robber Can Hide and Ride
- Cops and Robbers on Geometric Graphs
- Asteroidal Triple-Free Graphs
- The Cops and Robber game on graphs with forbidden (induced) subgraphs
- Fast Robber in Planar Graphs
- A better bound for the cop number of general graphs
- Variations of cops and robbers game on grids
This page was built for publication: Cops and robber on butterflies, grids, and AT-free graphs
