Abstract
We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the monotonic zero-visibility copnumber can be bounded both above and below by positive multiples of the pathwidth.
Citations
-
1 6
CrossRef
-
0
Web of Science
-
1 5
Scopus
Authors (4)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
JOURNAL OF COMBINATORIAL OPTIMIZATION
no. 29,
edition 3,
pages 541 - 564,
ISSN: 1382-6905 - Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Dereniowski D., Dyer D., Tifenbach R., Yang B.: Zero-visibility cops and robber and the pathwidth of a graph // JOURNAL OF COMBINATORIAL OPTIMIZATION. -Vol. 29, iss. 3 (2015), s.541-564
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s10878-014-9712-6
- Verified by:
- Gdańsk University of Technology
seen 120 times
Recommended for you
Zero-Visibility Cops and Robber Game on a Graph
- D. Dereniowski,
- D. Dyer,
- R. M. Tifenbach
- + 1 authors
2013
The complexity of zero-visibility cops and robber
- D. Dereniowski,
- D. Dyer,
- R. M. Tifenbach
- + 1 authors
2015
The Complexity of Zero-Visibility Cops and Robber
- D. Dereniowski,
- D. Dyer,
- R. M. Tifenbach
- + 1 authors
2014
Cops, a fast robber and defensive domination on interval graphs
- D. Dereniowski,
- T. Gavenčiak,
- J. Kratochvíl
2019