The fast robber on interval and chordal graphs
From MaRDI portal
(Redirected from Publication:476326)
Recommendations
Cites work
- scientific article; zbMATH DE number 5241699 (Why is no real title available?)
- A bound for the cops and robbers problem
- A witness version of the cops and robber game
- Catching a fast robber on interval graphs
- Chasing a fast robber on planar graphs and random graphs
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Cops and robbers from a distance
- Cops and robbers in graphs with large girth and Cayley graphs
- Graph searching and a min-max theorem for tree-width
- Lower bounds for the cop number when the robber is fast
- On Meyniel's conjecture of the cop number
- Pursuing a fast robber on a graph
- Randomized Pursuit-Evasion with Local Visibility
- The game of cops and robbers on graphs
- Variations on cops and robbers
- Vertex-to-vertex pursuit in a graph
Cited in
(4)
This page was built for publication: The fast robber on interval and chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476326)