zbMATH — the first resource for mathematics

On a game of policemen and robber. (English) Zbl 0615.05049
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.
Reviewer: Th.Andreae

05C99 Graph theory
05C05 Trees
game; policemen; robber; graph
Full Text: DOI
[1] Aigner, M.; Fromme, M., A game of cops and robbers, Discrete appl. math., 8, 1-12, (1984) · Zbl 0539.05052
[2] Andreae, T., Note on pursuit game played on graphs, Discrete appl. math., 9, 111-115, (1984) · Zbl 0548.05056
[3] T. Andreae, On a pursuit game played on graphs for which a minor is excluded, to appear. · Zbl 0641.90110
[4] Berge, C., Graphes, (1983), Gauthier Villars Paris · Zbl 0213.25702
[5] Quilliot, A., ()
[6] Quilliot, A., A short note about pursuit games played in a graph with a given genus, J. combin. theory (B), 38, 1, 89-92, (1985) · Zbl 0586.90104
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.