Chasing robbers on random graphs: zigzag theorem
From MaRDI portal
Recommendations
Cites work
- A better bound for the cop number of general graphs
- A game of cops and robbers
- A large deviation result on the number of small subgraphs of a random graph
- An annotated bibliography on guaranteed graph searching
- Cops and robbers in graphs with large girth and Cayley graphs
- scientific article; zbMATH DE number 5241699 (Why is no real title available?)
- Pursuit-evasion in models of complex networks
- Searching and sweeping graphs: a brief survey
- Vertex-to-vertex pursuit in a graph
Cited in
(34)- Some remarks on cops and drunk robbers
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Meyniel extremal families of abelian Cayley graphs
- Containment game played on random graphs: another zig-zag theorem
- The game of overprescribed Cops and Robbers played on graphs
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
- Subdivisions in the robber locating game
- To catch a falling robber
- Meyniel's conjecture holds for random graphs
- Variations on cops and robbers
- On Meyniel's conjecture of the cop number
- Chasing a fast robber on planar graphs and random graphs
- Chasing robbers on percolated random geometric graphs
- Pursuit-evasion in models of complex networks
- Cops and robbers on geometric graphs
- When does a random graph have constant cop number?
- Cops and invisible robbers: the cost of drunkenness
- Almost all cop-win graphs contain a universal vertex
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\)
- Cops and Robbers on diameter two graphs
- Revolutionaries and Spies on Random Graphs
- The robber locating game
- Cops and Robbers on Dynamic Graphs: Offline and Online Case
- Vertex Pursuit Games in Stochastic Network Models
- Cops and robbers from a distance
- Counting extensions revisited
- Meyniel's conjecture on graphs of bounded degree
- On the cop number of graphs of high girth
- New constructions of Meyniel extremal families of graphs
- Catching a robber on a random k-uniform hypergraph
- Cops and robber on hyperbolic manifolds (extended abstract)
- Cop number of random k-uniform hypergraphs (extended abstract)
- Lower bounds of location numbers
- Chasing robbers on random geometric graphs-an alternative approach
This page was built for publication: Chasing robbers on random graphs: zigzag theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3061185)
