{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:54Z","timestamp":1740107154316,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-020-02140-5","type":"journal-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T18:13:56Z","timestamp":1582136036000},"page":"591-605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Containment: A Variation of Cops and Robber"],"prefix":"10.1007","volume":"36","author":[{"given":"Danny","family":"Crytser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2681-9503","authenticated-orcid":false,"given":"Natasha","family":"Komarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Mackey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"key":"2140_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8, 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"2140_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1006\/aama.1993.1019","volume":"14","author":"A Berarducci","year":"1993","unstructured":"Berarducci, A., Intrigila, B.: On the cop number of a graph. Adv. Appl. Math. 14, 389\u2013403 (1993)","journal-title":"Adv. Appl. Math."},{"key":"2140_CR3","first-page":"56","volume":"5","author":"N Biggs","year":"1998","unstructured":"Biggs, N.: Constructions for cubic graphs with large girth. Electron. J. Comb. 5, 56\u201362 (1998)","journal-title":"Electron. J. Comb."},{"key":"2140_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02579289","volume":"3","author":"NL Biggs","year":"1983","unstructured":"Biggs, N.L., Hoare, M.J.: The sextet construction for cubic graphs. Combinatorica 3, 153\u2013165 (1983)","journal-title":"Combinatorica"},{"key":"2140_CR5","doi-asserted-by":"publisher","first-page":"5588","DOI":"10.1016\/j.disc.2008.04.004","volume":"309","author":"A Bonato","year":"2009","unstructured":"Bonato, A., Golovach, P., Hahn, G., Kratochvil, J.: The capture time of a graph. Discrete Math. 309, 5588\u20135595 (2009)","journal-title":"Discrete Math."},{"issue":"3","key":"2140_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/rsa.3240010303","volume":"1","author":"GR Brightwell","year":"1990","unstructured":"Brightwell, G.R., Winkler, P.: Maximum hitting time for random walks on graphs. J. Rand. Struct. and Alg. 1(3), 263\u2013276 (1990)","journal-title":"J. Rand. Struct. and Alg."},{"key":"2140_CR7","unstructured":"Brightwell, G.R., Winkler, P.: Hard constraints and the Bethe lattice: adventures at the interface of combinatorics and statistical physics. In: Li, T. (ed.) Proceedings of Int\u2019l. Congress of Mathematicians, Vol. III, pp. 605\u2013624 (2002)"},{"issue":"8","key":"2140_CR8","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1016\/j.disc.2012.01.002","volume":"312","author":"Nancy E Clarke","year":"2012","unstructured":"Clarke, Nancy E., MacGillivray, Gary: Characterizations of k-cop-win graphs. Discrete Math. 312(8), 1421\u20131425 (2012)","journal-title":"Discrete Math."},{"key":"2140_CR9","doi-asserted-by":"crossref","unstructured":"Dahan, X.: Regular graphs of large girth and arbitrary degree. arXiv:1110.5259v4 (2013)","DOI":"10.1007\/s00493-014-2897-6"},{"key":"2140_CR10","first-page":"131","volume":"5","author":"A Dudek","year":"2014","unstructured":"Dudek, A., Godinowicz, P., Pra\u0142at, P.: Cops and robbers playing on edges. J. Comb. 5, 131\u2013153 (2014)","journal-title":"J. Comb."},{"key":"2140_CR11","first-page":"264","volume":"11","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices. Mat. Lapok. 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok."},{"issue":"3","key":"2140_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0166-218X(87)90033-3","volume":"17","author":"P Frankl","year":"1987","unstructured":"Frankl, P.: Cops and robbers in graphs with large girth and Cayley graphs. Discrete Appl. Math. 17(3), 301\u2013305 (1987)","journal-title":"Discrete Appl. Math."},{"key":"2140_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0012-365X(02)00260-1","volume":"258","author":"G Hahn","year":"2002","unstructured":"Hahn, G., Laviolette, F., Sauer, N., Woodrow, R.E.: On cop-win graphs. Discrete Math. 258, 27\u201341 (2002)","journal-title":"Discrete Math."},{"key":"2140_CR14","unstructured":"Hahn, G., MacGillivray, G.: A characterisation of k-cop-win graphs and digraphs (2003)"},{"key":"2140_CR15","doi-asserted-by":"publisher","first-page":"2492","DOI":"10.1016\/j.disc.2005.12.038","volume":"306","author":"G Hahn","year":"2006","unstructured":"Hahn, G., MacGillivray, G.: A note on k-cop, l-robber games on graphs. Discrete Math. 306, 2492\u20132497 (2006)","journal-title":"Discrete Math."},{"issue":"2","key":"2140_CR16","first-page":"195","volume":"71","author":"L Lu","year":"2012","unstructured":"Lu, L., Peng, X.: On Meyniel\u2019s conjecture of the cop number. J. Gr. Theory 71(2), 195\u2013205 (2012)","journal-title":"J. Gr. Theory"},{"key":"2140_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0166-218X(87)90034-5","volume":"17","author":"M Maamoun","year":"1987","unstructured":"Maamoun, M., Meyniel, H.: On a game of policemen and robber. Discrete Appl. Math. 17, 307\u2013309 (1987)","journal-title":"Discrete Appl. Math."},{"key":"2140_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, P.: Vertex to vertex pursuit in a graph. Discrete Math. 43, 235\u2013239 (1983)","journal-title":"Discrete Math."},{"key":"2140_CR19","doi-asserted-by":"crossref","unstructured":"Pra\u0142at, P.: Containment game played on random graphs: another zig-zag theorem. Electron. J. Comb.22(2) (2015)","DOI":"10.37236\/4777"},{"key":"2140_CR20","unstructured":"Quilliot, A.: Homomorphismes, points fixes, r\u00e9tractations et jeux de poursuite dans les graphes, les ensembles ordonn\u00e9s et les espaces m\u00e9triques. PhD thesis, Universit\u00e9 de Paris VI (1983)"},{"key":"2140_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02579225","volume":"4","author":"A Weiss","year":"1984","unstructured":"Weiss, A.: Girths of bipartite sextet graphs. Combinatorica 4, 241\u2013245 (1984)","journal-title":"Combinatorica"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02140-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02140-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02140-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T10:24:26Z","timestamp":1613730266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02140-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2140"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02140-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"11 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}