Chasing a fast robber on planar graphs and random graphs
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Games on graphs (graph-theoretic aspects) (05C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random graphs (graph-theoretic aspects) (05C80) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)
Recommendations
Cites work
- A bound for the cops and robbers problem
- A game of cops and robbers
- A Separator Theorem for Nonplanar Graphs
- A witness version of the cops and robber game
- An Optimal Synchronizer for the Hypercube
- Bidimensional Parameters and Local Treewidth
- Chasing robbers on random graphs: zigzag theorem
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Cops and robbers from a distance
- Cops and robbers in a random graph
- Cops and robbers in graphs with large girth and Cayley graphs
- Graph searching and a min-max theorem for tree-width
- scientific article; zbMATH DE number 5241699 (Why is no real title available?)
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Linearity of grid minors in treewidth with applications through bidimensionality
- Meyniel's conjecture holds for random graphs
- On a generalization of Meyniel's conjecture on the Cops and Robbers game
- On Meyniel's conjecture of the cop number
- Pursuing a fast robber on a graph
- Pursuit-evasion in models of complex networks
- Randomized Pursuit-Evasion with Local Visibility
- The treewidth and pathwidth of hypercubes
- Variations on cops and robbers
- Vertex-to-vertex pursuit in a graph
- When does a random graph have constant cop number?
Cited in
(13)- Cops and Robber game with a fast robber on expander graphs and random graphs
- Catching an infinitely fast robber on a grid
- Containment game played on random graphs: another zig-zag theorem
- Network decontamination with a single agent
- A probabilistic version of the game of zombies and survivors on graphs
- An introduction to lazy cops and robbers on graphs
- The fast robber on interval and chordal graphs
- Escaping an infinitude of lions
- Fast Robber in Planar Graphs
- Lazy cops and robbers on hypercubes
- Pursuit-evasion in graphs: zombies, lazy zombies and a survivor
- An introduction to the deduction number
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
This page was built for publication: Chasing a fast robber on planar graphs and random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940989)
