论文信息 - A simple method of computing the catch time - 字舞流文

A simple method of computing the catch time

We describe a simple method for computing the maximum length of the game cop and robber, assuming optimal play for both sides.

Gary MacGillivray | Stephen Finbow | Nancy E. Clarke

[1] B. Intrigila,et al. On the Cop Number of a Graph , 1993 .

[2] Victor Chepoi,et al. On Distance-Preserving and Domination Elimination Orderings , 1998, SIAM J. Discret. Math..

[3] Nancy E. Clarke. Constrained cops and robber. , 2002 .

[4] Anthony Bonato,et al. The Game of Cops and Robbers on Graphs , 2011 .

[5] Peter Winkler,et al. Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[6] Robert Ganian,et al. Cops-and-robbers: Remarks and problems , 2013 .

[7] Victor Chepoi,et al. Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof , 1997, J. Comb. Theory, Ser. B.

[8] Gary MacGillivray,et al. Characterizations of k-copwin graphs , 2012, Discret. Math..