|
|||||
|
|
On a game of policemen and robber |
|
| Affiliation: | E.R. 175 Combinatoire, Université P. et M. Curie U.E.R. 48, 4 Place Jussieu 75005, Paris, France |
| Abstract: | We consider a game where policemen try to catch a robber on a graph G (as defined by A. Quilliot) and we find the exact minimal number of policemen needed when G is a Cartesian product of trees. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |