M. Aigner and M. Fromme, A game of cops and robbers, Discrete Applied Mathematics, vol.8, issue.1, pp.1-12, 1984.
DOI : 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, issue.2, pp.225-238, 2012.
DOI : 10.4310/JOC.2012.v3.n2.a6

V. Boginski, S. Butenko, and P. M. Pardalos, On structural properties of the market graph, In: Innovation in Financial and Economic Networks, pp.29-45, 2003.

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, E. Infeld, H. Pokhrel, and P. , Pra lat, Common adversaries form alliances: modelling complex networks via anti-transitivity, Proceedings of the 14th Workshop on Algorithms and Models for the Web Graph, 2017.
DOI : 10.1007/978-3-319-67810-8_2

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

A. Bonato and B. Yang, Graph Searching and Related Problems, Handbook of Combinatorial Optimization, 2011.
DOI : 10.1007/978-1-4419-7997-1_76

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

W. Guo, X. Lu, G. M. Donate, and S. Johnson, The spatial ecology of war and peace, 2017.

L. Lu and X. Peng, On Meyniel's conjecture of the cop number, Journal of Graph Theory, vol.38, issue.3, pp.192-205, 2012.
DOI : 10.1002/jgt.20642

R. J. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, issue.2-3, pp.43-235, 1983.
DOI : 10.1016/0012-365X(83)90160-7

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, Thèse d'Etat, pp.131-145, 1983.

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

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