On a game of policemen and robber (Q1820799): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A game of cops and robbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on a pursuit game played on graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a pursuit game played on graphs for which a minor is excluded / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5615282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A short note about pursuit games played on a graph with a given genus / rank | |||
Normal rank | |||
Latest revision as of 18:09, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a game of policemen and robber |
scientific article |
Statements
On a game of policemen and robber (English)
0 references
1987
0 references
The authors consider a game where policemen try to catch a robber on a graph G (as previously studied by several authors, e.g., A. Quilliot, M. Aigner and M. Fromme, P. Frankl, Y. O. Hamidoune and the reviewer). They determine the exact minimal number of policemen needed when G is a Cartesian product of trees.
0 references
game
0 references
policemen
0 references
robber
0 references
graph
0 references
