{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T06:32:20Z","timestamp":1780813940542,"version":"3.54.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,4]],"date-time":"2012-11-04T00:00:00Z","timestamp":1351987200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00373-012-1246-z","type":"journal-article","created":{"date-parts":[[2012,11,3]],"date-time":"2012-11-03T08:36:21Z","timestamp":1351931781000},"page":"119-124","source":"Crossref","is-referenced-by-count":10,"title":["A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces"],"prefix":"10.1007","volume":"30","author":[{"given":"Nancy E.","family":"Clarke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dirk Oliver","family":"Theis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,11,4]]},"reference":[{"key":"1246_CR1","doi-asserted-by":"crossref","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":"1246_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(84)90012-X","volume":"9","author":"T. Andreae","year":"1984","unstructured":"Andreae T.: Note on a pursuit game played on graphs. Discrete Appl. Math. 9, 111\u2013115 (1984)","journal-title":"Discrete Appl. Math."},{"key":"1246_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0095-8956(86)90026-2","volume":"41","author":"T. Andreae","year":"1986","unstructured":"Andreae T.: On a pursuit game played on graphs for which a minor is excluded. J. Combin. Th. Ser. B 41, 37\u201347 (1986)","journal-title":"J. Combin. Th. Ser. B"},{"key":"1246_CR4","doi-asserted-by":"crossref","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":"1246_CR5","unstructured":"Cain, G.L.: Introduction to General Topology. Addison-Wesley, Boston (1994)"},{"key":"1246_CR6","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1016\/j.disc.2012.01.002","volume":"312","author":"N.E. Clarke","year":"2012","unstructured":"Clarke N.E., MacGillivray G.: Characterizations of k-copwin graphs. Discrete Math. 312, 1421\u20131425 (2012)","journal-title":"Discrete Math."},{"key":"1246_CR7","doi-asserted-by":"crossref","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins University Press, Baltimore (2001)","DOI":"10.56021\/9780801866890"},{"key":"1246_CR8","unstructured":"Nowakowski, R.J., Schr\u00f6der, B.S.W.: Bounding the cop number using the crosscap number (1997, Preprint)"},{"key":"1246_CR9","first-page":"23","volume":"43","author":"R.J. Nowakowski","year":"1983","unstructured":"Nowakowski R.J., Winkler P.: Vertex to vertex pursuit in a graph. Discrete Math. 43, 23\u201329 (1983)","journal-title":"Discrete Math."},{"key":"1246_CR10","unstructured":"Quilliot, A.: Jeux et Points Fixes sur les graphes. Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 de Paris VI, pp. 131\u2013145 (1978)"},{"key":"1246_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0095-8956(85)90093-0","volume":"38","author":"A. Quilliot","year":"1985","unstructured":"Quilliot A.: A short note about pursuit games played on a graph with a given genus. J. Combin. Theory Ser. B 38, 89\u201392 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1246_CR12","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, B.S.W.: The copnumber of a graph is bounded by $${\\lfloor\\frac32\\mathrm{genus}(G)\\rfloor+3}$$ . In: \u201cCategorical Perspectives\u201d\u2014Proceedings of the Conference in Honor of George Strecker\u2019s 60th Birthday, pp. 243\u2013263. Birkh\u00e4user, Basel (2001)","DOI":"10.1007\/978-1-4612-1370-3_14"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1246-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1246-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1246-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T14:29:09Z","timestamp":1687789749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1246-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,4]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1246"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1246-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,4]]}}}