Pages that link to "Item:Q4598355"
From MaRDI portal
The following pages link to Characterizations and algorithms for generalized Cops and Robbers games (Q4598355):
Displaying 14 items.
- Simultaneously moving cops and robbers (Q306253) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- The one-cop-moves game on planar graphs (Q2051905) (← links)
- Some game-theoretic remarks on two-player generalized cops and robbers games (Q2068910) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Generalized cops and robbers: a multi-player pursuit game on graphs (Q2292118) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- Selfish cops and active robber: multi-player pursuit evasion on graphs (Q2420619) (← links)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
- A cop and robber game on edge-periodic temporal graphs (Q6564615) (← links)