M. Aigner and M. Fromme, A game of Cops and Robbers, vol.8, pp.1-12, 1984.
DOI : 10.1016/0166-218x(84)90073-8
URL : https://doi.org/10.1016/0166-218x(84)90073-8

W. Baird and A. Bonato, Meyniel's conjecture on the cop number: a survey, Journal of Combinatorics, vol.3, pp.225-238, 2012.
DOI : 10.4310/joc.2012.v3.n2.a6
URL : http://www.intlpress.com/site/pub/files/_fulltext/journals/joc/2012/0003/0002/JOC-2012-0003-0002-a006.pdf

A. Bonato, G. Hahn, and C. Wang, The cop density of a graph, Contributions to Discrete Mathematics, vol.2, pp.133-144, 2007.

A. Bonato and R. J. Nowakowski, The Game of Cops and Robbers on Graphs, 2011.
DOI : 10.1090/stml/061

A. Bonato and P. Praa, Graph Searching Games and Probabilistic Methods, 2017.
DOI : 10.1201/9781315212135

A. Bonato and B. Yang, Graph searching and related problems, Handbook of Combinatorial Optimization, 2011.
DOI : 10.1007/978-1-4419-7997-1_76

B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokóo-l et al., Localization game on geometric and planar graphs, 2018.
DOI : 10.1016/j.dam.2018.04.017
URL : https://hal.archives-ouvertes.fr/hal-01620365

N. E. Clarke, A game of Cops and Robbers played with partial information, Congressus Numerantium, vol.166, pp.145-159, 2004.

N. E. Clarke, A witness version of the Cops and Robbers game, Discrete Mathematics, vol.309, pp.3292-3298, 2009.

N. E. Clarke and E. L. Connon, Cops, robber, and alarms, vol.81, pp.283-296, 2006.

N. E. Clarke, D. Cox, C. Duffy, D. Dyer, S. Fitzpatrick et al., Limited visibility Cops and Robbers, 2018.

N. E. Clarke and R. J. Nowakowski, Cops, robber, and photo radar, vol.56, pp.97-103, 2000.

A. Dudek, A. Frieze, and W. Pegden, A note on the localization number of random graphs: diameter two case, 2018.

F. V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040
URL : https://doi.org/10.1016/j.tcs.2008.02.040

P. , Cops and robbers in graphs with large girth and Cayley graphs, Discrete Applied Mathematics, vol.17, pp.301-305, 1987.

W. B. Kinnersley, Cops and robbers is EXPTIME-complete, Journal of Combinatorial Theory, Series B, vol.111, pp.201-220, 2015.

M. Janosov, C. Virágh, G. Vásárhelyi, and T. Vicsek, Group chasing tactics: how to catch a faster prey, New Journal of Physics, vol.19, 2017.

L. Lu and X. Peng, On Meyniel's conjecture of the cop number, Journal of Graph Theory, vol.71, pp.192-205, 2012.

R. J. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, pp.235-239, 1983.

A. Quilliot, Jeux et pointes fixes sur les graphes, Thèse de 3` eme cycle, pp.131-145, 1978.

A. Quilliot, Probì emes de jeux, de point Fixe, de connectivité et de represésentation sur des graphes, des ensembles ordonnés et des hypergraphes, pp.131-145, 1983.

B. S. Schroeder, The copnumber of a graph is bounded by 3 2 genus(G) + 3, Categorical Perspectives, Trends Math, pp.243-263, 2001.

D. B. West, Introduction to Graph Theory, 2001.