The following pages link to A game of cops and robbers (Q793755):
Displaying 45 items.
- Most Generalized Petersen graphs of girth 8 have cop number 4 (Q5090526) (← links)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
- Fully Active Cops and Robbers (Q5109068) (← links)
- Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas (Q5111067) (← links)
- (Q5136239) (← links)
- On Colourability of Polygon Visibility Graphs (Q5136313) (← links)
- Line-of-Sight Pursuit in Monotone and Scallop Polygons (Q5149564) (← links)
- Bounding the Cop Number of a Graph by Its Genus (Q5163511) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- Cop-Robber Guarding Game with Cycle Robber Region (Q5321698) (← links)
- Lazy Cops and Robbers on Hypercubes (Q5364259) (← links)
- Vertex Pursuit Games in Stochastic Network Models (Q5458505) (← links)
- Control Sequencing in a Game of Identity Pursuit-Evasion (Q5501220) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
- Cops and robber on some families of oriented graphs (Q5896831) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- Variations of cops and robbers game on grids (Q5919113) (← links)
- Pursuit evasion on polyhedral surfaces (Q5963379) (← links)
- A cop-winning strategy on strongly cop-win graphs (Q6041547) (← links)
- On the contractibility of random Vietoris-Rips complexes (Q6045788) (← links)
- Coarse geometry of the cops and robber game (Q6080533) (← links)
- On the cop number of graphs of high girth (Q6093134) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)
- (Q6124764) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
- (Q6159869) (← links)
- Confining the robber on cographs (Q6165484) (← links)
- A note on hyperopic cops and robber (Q6174757) (← links)
- On colourability of polygon visibility graphs (Q6181985) (← links)
- Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs (Q6195949) (← links)
- On graphs coverable by \({k}\) shortest paths (Q6561322) (← links)
- Guarding isometric subgraphs and cops and robber in planar graphs (Q6563993) (← links)
- A cop and robber game on edge-periodic temporal graphs (Q6564615) (← links)
- Cops and robber game in higher-dimensional manifolds with spherical and Euclidean metric (Q6600260) (← links)
- Graph games and logic design (Q6601767) (← links)
- Improved bounds on the cop number of a graph drawn on a surface (Q6604681) (← links)
- Cops and robbers on 1-planar graphs (Q6618244) (← links)
- Bounding the cop number of a graph by its genus (Q6621170) (← links)
- Guarding isometric subgraphs and lazy cops and robbers (Q6621210) (← links)
- Pursuit-evasion in graphs: zombies, lazy zombies and a survivor (Q6635086) (← links)
- On the cop number of Sierpinski-like graphs (Q6637031) (← links)
- On the number of pursuers that guarantees the capture of the evader in the game on the graph of icosahedral edges (Q6646199) (← links)
- Parameterizing path partitions (Q6664058) (← links)
- Improved bounds on the cop number when forbidding a minor (Q6667593) (← links)
