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

]. T. And84 and . Andreae, Note on a pursuit game played on graphs, Discrete Applied Maths, vol.9, pp.111-115, 1984.

]. V. Che97 and . Chepoi, Bridged graphs are cop-win graphs: An algorithmic proof, J. Comb. Theory, Ser. B, vol.69, issue.1, pp.97-100, 1997.

]. P. Fra87 and . Frankl, Cops and robbers in graphs with large girth and cayley graphs, Discrete Applied Maths, vol.17, pp.301-305, 1987.

E. [. Goldstein and . Reingold, The complexity of pursuit on a graph, Theoretical Computer Science, vol.143, issue.1, pp.93-112, 1995.
DOI : 10.1016/0304-3975(95)80026-6

G. Hahn and G. Macgillivray, A note on <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-cop, <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>l</mml:mi></mml:math>-robber games on graphs, Discrete Mathematics, vol.306, issue.19-20, pp.2492-2497, 2006.
DOI : 10.1016/j.disc.2005.12.038

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

]. A. Qui83 and . Quilliot, Thèse de doctorat d'´ etat The copnumber of a graph is bounded by ? 3 2 genus(g)? + 3, Trends Math, pp.243-263, 1983.