On a game of policemen and robber (Q1820799)

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.