A game of cops and robbers played on products of graphs

Discrete Mathematics

Volumn 186, Issue 1-3, 1998, Pages 253-268

  Neufeld, S ^a   Nowakowski, R ^b  

^a UNIVERSITY OF WINNIPEG   (Canada)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007454573     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00165-9     Document Type: Article

References (13)

1. M. Aigner, M. Fromme, A game of cops and robbers, Discrete Appl. Math. 8 (1984) 1-12.
2. T. Andreae, On a pursuit game played on graphs for which a minor is excluded, J. Combin. Theory Ser. B 41 (1986) 37-47.
3. R. Anstee, M. Farber, On bridged graphs and cop-win graphs, J. Combin. Theory 44 (1988) 22-28.
4. G. Chartrand, L. Lesniak, Graphs and Digraphs, Wadsworth & Brooks/Cole, CA, 1986.
5. P. Frankl, Cops and robbers in graphs with large girth and Cayley graphs, Discrete Appl. Math. 17 (1987) 301-305.
6. P. Frankl, On a pursuit game on Cayley graphs, Combinatorica 7 (1987) 67-70.
7. M. Maamoun, H. Meyniel, On a game of policemen and robber, Discrete Appl. Math. 17 (1987) 307-309.
8. S. Neufeld, A game of cops and robbers, M.Sc. Thesis, Dalhousie University, Halifax, 1991.
9. S. Neufeld, R. Nowakowski, A vertex-to-vertex pursuit game played on disjoint sets of edges, in: N. Sauer (Ed.), Proc. NATO Advanced Study Institute on Finite and Infinite Combinatorics in Sets and Logic, Kluwer Academic Publications, Dordrecht, 1993, pp. 299-312.
10. R. Nowakowski, P. Winkler, Vertex to vertex pursuit in a graph, Discrete Math. 43 (1983) 230-239.
11. A. Quilliot, Thèse d'Etat, Université de Paris VI, 1983.
12. A. Quilliot, A short note about pursuit games played on a graph with a given genus, J. Combin. Theory Ser. B 38 (1985) 89-92.
13. R. Tošić, The search number of the Cartesian product of graphs, Univ. Novom Sabu Zb. Rad. Prirod. -Mat Fak. Ser. Mat. 17 (1987) 239-243.