The fast robber on interval and chordal graphs

DOI10.1016/j.dam.2014.07.029zbMath1303.05128OpenAlexW2050912278MaRDI QIDQ476326

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

zbMATH Keywords

chordal graphsinterval graphscops and robber gamefast robber

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Catching an infinitely fast robber on a grid ⋮ Cops, a fast robber and defensive domination on interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Cops and robbers from a distance
• A witness version of the cops and robber game
• Cops and robbers in graphs with large girth and Cayley graphs
• Graph searching and a min-max theorem for tree-width
• Vertex-to-vertex pursuit in a graph
• Cops and Robber game with a fast robber on expander graphs and random graphs
• Pursuing a fast robber on a graph
• Variations on cops and robbers
• On Meyniel's conjecture of the cop number
• Chasing a Fast Robber on Planar Graphs and Random Graphs
• Catching a Fast Robber on Interval Graphs
• A Bound for the Cops and Robbers Problem
• Lower Bounds for the Cop Number when the Robber is Fast
• Randomized Pursuit-Evasion with Local Visibility

This page was built for publication: The fast robber on interval and chordal graphs