The following pages link to (Q3090934):
Displaying 50 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)
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Pursuit evasion on infinite graphs (Q343924) (← links)
- Cops and invisible robbers: the cost of drunkenness (Q385064) (← links)
- The guarding game is E-complete (Q389949) (← links)
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (Q468433) (← links)
- The fast robber on interval and chordal graphs (Q476326) (← links)
- Cops and Robbers on diameter two graphs (Q482211) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Lazy Cops and Robbers on generalized hypercubes (Q526267) (← links)
- The fast search number of a Cartesian product of graphs (Q526821) (← links)
- The game of Cops and Robber on circulant graphs (Q528556) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- Centroidal localization game (Q668034) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- Bounds on the length of a game of cops and robbers (Q724868) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- Cops and robber on butterflies and solid grids (Q831728) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- Directed elimination games (Q896668) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- Hunting rabbits on the hypercube (Q1625793) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- The robot crawler graph process (Q1671307) (← links)
- Game of cops and robbers in oriented quotients of the integer grid (Q1685996) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← 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)
