{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:34:45Z","timestamp":1743032085832,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319559100"},{"type":"electronic","value":"9783319559117"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_36","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:23:37Z","timestamp":1490005417000},"page":"499-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Conjecture of the Smallest 3-Cop-Win Planar Graph"],"prefix":"10.1007","author":[{"given":"Photchchara","family":"Pisantechakool","sequence":"first","affiliation":[]},{"given":"Xuehou","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"issue":"1","key":"36_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), 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"36_CR2","first-page":"5","volume":"59","author":"B Alspach","year":"2004","unstructured":"Alspach, B.: Searching and sweeping graphs: a brief survey. Le Mathematiche 59, 5\u201337 (2004)","journal-title":"Le Mathematiche"},{"key":"36_CR3","first-page":"70","volume":"9","author":"W Baird","year":"2014","unstructured":"Baird, W., Beveridge, A., Bonato, A., Codenotti, P., Maurer, A., McCauley, J., Valera, S.: On the minimum order of k-cop-win graphs. Contrib. Discrete Math. 9, 70\u201384 (2014)","journal-title":"Contrib. Discrete Math."},{"issue":"10","key":"36_CR4","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1177\/0278364912452894","volume":"31","author":"D Bhaduaria","year":"2012","unstructured":"Bhaduaria, D., Klein, K., Isler, V., Suri, S.: Capturing an evader in polygonal environments with obstacles: the full visibility case. Int. J. Robot. Res. 31(10), 1176\u20131189 (2012)","journal-title":"Int. J. Robot. Res."},{"key":"36_CR5","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)"},{"key":"36_CR6","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)"},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"RJ Nowakowski","year":"1983","unstructured":"Nowakowski, R.J., Winkler, R.P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 235\u2013239 (1983)","journal-title":"Discrete Math."},{"key":"36_CR8","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and Applications of Graph","author":"TD Parsons","year":"1978","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graph. Lecture Notes in Mathematics, vol. 642, pp. 426\u2013441. Springer, Heidelberg (1978). doi:\n10.1007\/BFb0070400"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-48749-6_1","volume-title":"Combinatorial Optimization and Applications","author":"P Pisantechakool","year":"2016","unstructured":"Pisantechakool, P., Tan, X.: On the capture time of cops and robbers game on a planar graph. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 3\u201317. Springer, Heidelberg (2016). doi:\n10.1007\/978-3-319-48749-6_1"},{"key":"36_CR10","unstructured":"Quilliot, A.: Th\u00e8se de 3\n $$^\\circ $$\n cycle. In: Universit\u00e9 de Paris VI, pp. 131\u2013145 (1978)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T04:15:19Z","timestamp":1511324119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}