The following pages link to (Q3090934):
Displaying 28 items.
- To catch a falling robber (Q265090) (← links)
- Cop vs. gambler (Q267177) (← links)
- A deterministic version of the game of zombies and survivors on graphs (Q313777) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
- A survey of graph burning (Q4986283) (← links)
- Shape recognition by a finite automaton robot (Q5005154) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- On generalised Petersen graphs of girth 7 that have cop number 4 (Q5045260) (← links)
- Fundamental Groupoids for Graphs (Q5077354) (← links)
- (Q5091040) (← links)
- (Q5136239) (← links)
- Toward multi-target self-organizing pursuit in a partially observable Markov game (Q6052618) (← links)
- A simple logic of the hide and seek game (Q6057624) (← links)
- The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
- The one-visibility localization game (Q6073890) (← links)
- Coarse geometry of the cops and robber game (Q6080533) (← links)
- The localization game on oriented graphs (Q6110602) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- Edge searching and fast searching with constraints (Q6122599) (← links)
- (Q6124764) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
- Forming tile shapes with simple robots (Q6151177) (← links)
- (Q6159869) (← links)
- A note on hyperopic cops and robber (Q6174757) (← links)
- The localization number of designs (Q6188118) (← links)
- Cops and robber game on infinite chessboard (Q6193779) (← links)
- Burning Numbers of Barbells (Q6489821) (← links)
