Zero-Visibility Cops and Robber Game on a Graph

We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops & robber game in one way: the robber is invisible. We show that this model is not monotonic. We also provide bounds on both the zero-visibility copnumber and monotonic zero-visibility copnumber in terms of the pathwidth.

[1]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[2]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[3]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[4]  Sampath Kannan,et al.  Randomized Pursuit-Evasion with Local Visibility , 2006, SIAM J. Discret. Math..

[5]  Volkan Isler,et al.  The role of information in the cop-robber game , 2008, Theor. Comput. Sci..

[6]  Boting Yang.  Strong-mixed searching and pathwidth , 2007, J. Comb. Optim..

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

[8]  Dariusz Dereniowski.  From Pathwidth to Connected Pathwidth , 2012, SIAM J. Discret. Math..

[9]  Micah Adler,et al.  Randomized Pursuit-Evasion In Graphs , 2003, Comb. Probab. Comput..

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

[11]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[12]  Nancy G. Kinnersley,et al.  The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..

[13]  Boting Yang,et al.  Sweeping graphs with large clique number , 2009, Discret. Math..

[14]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[15]  Ivan Hal Sudborough,et al.  The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..