On a game of policemen and robber (Q1820799)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1820799 |
scientific article; zbMATH DE number 3995732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a game of policemen and robber |
scientific article; zbMATH DE number 3995732 |
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
0.8401898741722107
0 references
0.8328940868377686
0 references
0.8181169629096985
0 references
