The fast robber on interval and chordal graphs
type: Item
instance of: scholarly article
title: The fast robber on interval and chordal graphs
zbMATH Open document ID: 1303.05128
author: Abbas Mehrabian
published in: Discrete Applied Mathematics
publication date: 2014-11-28T00:00:00Z
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A24
zbMATH DE Number: 6375322
zbMATH Keywords: cops and robber game
zbMATH Keywords: fast robber
zbMATH Keywords: interval graphs
zbMATH Keywords: chordal graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2014.07.029
OpenAlex ID: W2050912278
cites work: Chasing a Fast Robber on Planar Graphs and Random Graphs
cites work: Cops and robbers from a distance
cites work: Q3090934
cites work: A witness version of the cops and robber game
cites work: Pursuing a fast robber on a graph
cites work: Cops and robbers in graphs with large girth and Cayley graphs
cites work: Variations on cops and robbers
cites work: Catching a Fast Robber on Interval Graphs
cites work: Q5445040
cites work: Randomized Pursuit-Evasion with Local Visibility
cites work: On Meyniel's conjecture of the cop number
cites work: Lower Bounds for the Cop Number when the Robber is Fast
cites work: Cops and Robber game with a fast robber on expander graphs and random graphs
cites work: Vertex-to-vertex pursuit in a graph
cites work: A Bound for the Cops and Robbers Problem
cites work: Graph searching and a min-max theorem for tree-width
DOI: 10.1016/J.DAM.2014.07.029
description: scientific article; zbMATH DE number 6375322