On a pursuit game played on graphs for which a minor is excluded
type: Item
instance of: scholarly article
title: On a pursuit game played on graphs for which a minor is excluded
zbMATH Open document ID: 0641.90110
DOI: 10.1016/0095-8956(86)90026-2
author: Thomas Andreae
published in: Journal of Combinatorial Theory. Series B
publication date: 1986-01-01T00:00:00Z
review text: This paper concerns a game played on a graph, called pursuit game and defined precisely in the text, in which one player moves s cops to catch a robber moved by the other player. Minor conditions about forbidden actions are imposed on the graph so as to establish upper bounds on the minimal number of pursuers that are sufficient to catch the evader.
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4045533
zbMATH Keywords: games on graphs
zbMATH Keywords: catch a robber
reviewed by: Weixuan Li
MaRDI profile type: Publication
full work available at URL: 0095-8956(86)90026-2
OpenAlex ID: W2109300296
cites work: A game of cops and robbers
cites work: Note on a pursuit game played on graphs
cites work: Q3097395
cites work: Some remarks on interval graphs
cites work: The complexity of searching a graph
cites work: Fixed-edge theorem for graphs with loops
cites work: Vertex-to-vertex pursuit in a graph
cites work: Some results about pursuit games on metric spaces obtained through graph theory techniques
cites work: A short note about pursuit games played on a graph with a given genus
cites work: Q5592127
cites work: Q3880860
description: scientific article; zbMATH DE number 4045533