Abstract
In the cops and robber game, two players play alternately by moving their tokens along the edges of a graph. The first one plays with the cops and the second one with one robber. The cops aim at capturing the robber, while the robber tries to infinitely evade the cops. The main problem consists in minimizing the number of cops used to capture the robber in a graph. This minimum number is called the cop-number of the graph. If the cops and the robber have the same velocity, \(3+\frac{3}{2}g\) cops are sufficient to capture one robber in any graph with genus g (Schröder, 2001). In the particular case of a grid, 2 cops are sufficient.
We investigate the game in which the robber is slightly faster than the cops. In this setting, we prove that the cop-number of planar graphs becomes unbounded. More precisely, we prove that \(\Omega(\sqrt{\log n})\) cops are necessary to capture a fast robber in the n ×n square-grid. This proof consists in designing an elegant evasion-strategy for the robber. Then, it is interesting to ask whether a high value of the cop-number of a planar graph H is related to a large grid G somehow contained in H. We prove that it is not the case when the notion of containment is related to the classical transformations of edge removal, vertex removal, and edge contraction. For instance, we prove that there are graphs with cop-number at most 2 and that are subdivisions of arbitrary large grids. On the positive side, we prove that, if a planar graph H planar a large grid as an induced subgraph, then H has large cop-number. Note that, generally, the cop-number of a graph H is not closed by taking induced subgraphs G, even if H is planar and G is an distance-hereditary induced-subgraph.
Authors acknowledge the support of CONICYT via Anillo en Redes ACT08.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Applied Mathematics 8, 1–12 (1984)
Anstee, R.P., Farber, M.: On bridged graphs and cop-win graphs. J. Comb. Theory, Ser. B 44(1), 22–28 (1988)
Alspach, B.: Searching and sweeping graphs: a brief survey. In: Le Matematiche, pp. 5–37 (2004)
Andreae, T.: Note on a pursuit game played on graphs. Discrete Applied Mathematics 9, 111–115 (1984)
Andreae, T.: On a pursuit game played on graphs for which a minor is excluded. J. Comb. Theory, Ser. B 41(1), 37–47 (1986)
Berarducci, A., Intrigila, B.: On the cop number of a graph. Adv. in Applied Math. 14, 389–403 (1993)
Bodlaender, H.L.: A partial -arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1-2), 1–45 (1998)
Chepoi, V.: Bridged graphs are cop-win graphs: An algorithmic proof. J. Comb. Theory, Ser. B 69(1), 97–100 (1997)
Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)
Farber, M.: Bridged graphs and geodesic convexity. Discrete Applied Mathematics 66, 249–257 (1987)
Frankl, P.: Cops and robbers in graphs with large girth and cayley graphs. Discrete Applied Mathematics 17, 301–305 (1987)
Goldstein, A.S., Reingold, E.M.: The complexity of pursuit on a graph. Theor. Comput. Sci. 143(1), 93–112 (1995)
Hahn, G., MacGillivray, G.: A note on k-cop, l-robber games on graphs. Discrete Math. 306, 2492–2497 (2006)
Nisse, N., Suchan, K.: Fast robber in planar graphs. Technical Report, CMM-B-08/03-200, Santiago, Chili (March 2008)
Nowakowski, R.J., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics 43, 235–239 (1983)
Quilliot, A.: Thèse de doctorat d’état. Ph.D thesis, Université de Paris VI, France (1983)
Quilliot, A.: A short note about pursuit games played on a graph with a given genus. J. Comb. Theory, Ser. B 38(1), 89–92 (1985)
Schröder, B.S.W.: The copnumber of a graph is bounded by \(\lfloor \frac{3}{2} genus (g) \rfloor + 3\). Trends Math., 243–263 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nisse, N., Suchan, K. (2008). Fast Robber in Planar Graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2008. Lecture Notes in Computer Science, vol 5344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92248-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-92248-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92247-6
Online ISBN: 978-3-540-92248-3
eBook Packages: Computer ScienceComputer Science (R0)