The fast robber on interval and chordal graphs
From MaRDI portal
Publication:476326
DOI10.1016/J.DAM.2014.07.029zbMATH Open1303.05128OpenAlexW2050912278MaRDI QIDQ476326FDOQ476326
Authors: Abbas Mehrabian 
Publication date: 28 November 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.029
Recommendations
Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Graph searching and a min-max theorem for tree-width
- Cops and robbers in graphs with large girth and Cayley graphs
- Vertex-to-vertex pursuit in a graph
- Variations on cops and robbers
- On Meyniel's conjecture of the cop number
- The game of cops and robbers on graphs
- A bound for the cops and robbers problem
- Chasing a fast robber on planar graphs and random graphs
- Pursuing a fast robber on a graph
- Cops and robbers from a distance
- A witness version of the cops and robber game
- Title not available (Why is that?)
- Randomized Pursuit-Evasion with Local Visibility
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Catching a fast robber on interval graphs
- Lower bounds for the cop number when the robber is fast
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)
