The following pages link to (Q3090934):
Displaying 50 items.
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Fast searching on cactus graphs (Q2696935) (← links)
- Meyniel's conjecture holds for random graphs (Q2795750) (← links)
- Cops and Robbers on Graphs Based on Designs (Q2864796) (← links)
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) (Q2947016) (← links)
- Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
- Open Problems on Search Games (Q2961395) (← links)
- On the Conjecture of the Smallest 3-Cop-Win Planar Graph (Q2988846) (← links)
- Fast Searching on Cartesian Products of Graphs (Q2988858) (← links)
- Cops and Robbers on Geometric Graphs (Q3168443) (← links)
- A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity (Q3297755) (← links)
- Cops and Robbers on Graphs of Bounded Diameter (Q3300761) (← links)
- Evacuating an Equilateral Triangle in the Face-to-Face Model (Q3300807) (← links)
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond (Q3460727) (← links)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
- Revolutionaries and Spies on Random Graphs (Q4921570) (← links)
- A survey of graph burning (Q4986283) (← links)
- A paradox for expected hitting times (Q4997056) (← links)
- The damage throttling number of a graph (Q5000318) (← 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)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- Game with Slow Pursuers on the Edge Graphs of Regular Simplexes (Q5057950) (← links)
- Differential Game with Slow Pursuers on the Edge Graph of a Simplex (Q5072237) (← links)
- Fundamental Groupoids for Graphs (Q5077354) (← links)
- Most Generalized Petersen graphs of girth 8 have cop number 4 (Q5090526) (← links)
- (Q5091040) (← links)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
- Fully Active Cops and Robbers (Q5109068) (← links)
- (Q5136239) (← links)
- Line-of-Sight Pursuit in Monotone and Scallop Polygons (Q5149564) (← links)
- Bounding the Cop Number of a Graph by Its Genus (Q5163511) (← links)
- Lazy Cops and Robbers on Hypercubes (Q5364259) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)
- How to Burn a Graph (Q5856432) (← links)
- Reviews (Q5885246) (← links)
- Cops and robber on some families of oriented graphs (Q5896831) (← links)
- Fast two-robot disk evacuation with wireless communication (Q5915701) (← links)
- Variations of cops and robbers game on grids (Q5919113) (← links)
- Vertex-edge domination in graphs (Q5919557) (← 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)
