Abstract
This paper considers the one-cop-moves game played on a graph. In this game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph’s edges with perfect information about each other’s positions. The goal of the cops is to capture the robber. At cops’ turns, exactly one cop is allowed to move from his location to an adjacent vertex; at robber’s turns, she is allowed to move from her location to an adjacent vertex or to stay still. We want to find the minimum number of cops to capture the robber. This number is known as the cop number. In this paper, we investigate the cop number of several classes of graphs, including graphs with treewidth at most 2, Halin graphs, and Cartesian product graphs. We also give a characterization of k-winnable graphs in the one-cop-moves game.
L. Wang—Research supported by a grant for Hong Kong Special Administrative Region, China (CityU 11210119).
B. Yang—Research supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2018-06800.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aigner, M., Fromme, M.: A game of cops and robbers. Discret. Appl. Math. 8, 1–12 (1984)
Alspach, B.: Sweeping and searching in graphs: a brief survey. Matematiche 5, 5–37 (2006)
Berarducci, A., Intrigila, B.: On the cop number of a graph. Adv. Appl. Math. 14(4), 389–403 (1993)
Bal, D., Bonato, A., Kinnersley, W.B., Pralat, P.: Lazy cops and robbers on hypercubes. Comb. Probab. Comput. 24(6), 829–837 (2015)
Bal, D., Bonato, A., Kinnersley, W.B., Pralat, P.: Lazy cops and robbers played on random graphs and graphs on surfaces. Int. J. Comb. 7(4), 627–642 (2016)
Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)
Bonato, A., Yang, B.: Graph searching and related problems. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 1511–1558. Springer, New York (2013). https://doi.org/10.1007/978-1-4419-7997-1_76
Clarke, N.E., MacGillivray, G.: Characterizations of \(k\)-copwin graphs. Discret. Math. 312, 1421–1425 (2012)
Gao, Z., Yang, B.: The one-cop-moves game on planar graphs. J. Comb. Optim. (2019). https://link.springer.com/article/10.1007/s10878-019-00417-x
Hahn, G.: Cops, robbers and graphs. Tatra Mt. Math. Publ. 36, 163–176 (2007)
Hahn, G., MacGillivray, G.: A note on \(k\)-cop, \(l\)-robber games on graphs. Discret. Math. 306, 2492–2497 (2006)
Joret, G., Kamiński, M., Theis, D.: The cops and robber game on graphs with forbidden (induced) subgraphs. Contrib. Discret. Math. 5, 40–51 (2010)
Maamoun, M., Meyniel, H.: On a game of policemen and robber. Discret. Appl. Math. 17, 307–309 (1987)
Nowakowski, R.J., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discret. Math. 43, 235–239 (1983)
Offner, D., Okajian, K.: Variations of cops and robber on the hypercube. Australas. J. Comb. 59(2), 229–250 (2014)
Quilliot, A.: Jeux et pointes fixes sur les graphes, thèse de 3ème cycle, Université de Paris VI, pp. 131–145 (1978)
Sullivan, B.W., Townsend, N., Werzanski, M.: The \(3 \times 3\) rooks graph is the unique smallest graph with lazy cop number 3. Preprint (2017). https://arxiv.org/abs/1606.08485
Theis, D.: The cops & robber game on series-parallel graphs. Preprint (2008). https://arxiv.org/abs/0712.2908
West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (1996)
Yang, B., Hamilton, W.: The optimal capture time of the one-cop-moves game. Theor. Comput. Sci. 588, 96–113 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, L., Yang, B. (2019). The One-Cop-Moves Game on Graphs of Small Treewidth. In: Li, Y., Cardei, M., Huang, Y. (eds) Combinatorial Optimization and Applications. COCOA 2019. Lecture Notes in Computer Science(), vol 11949. Springer, Cham. https://doi.org/10.1007/978-3-030-36412-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-030-36412-0_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36411-3
Online ISBN: 978-3-030-36412-0
eBook Packages: Computer ScienceComputer Science (R0)