{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:03:30Z","timestamp":1725570210335},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401568"},{"type":"electronic","value":"9783540448426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44842-x_91","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T16:38:01Z","timestamp":1290184681000},"page":"894-902","source":"Crossref","is-referenced-by-count":1,"title":["Four Colouring the Vertices of the Triangulation of a Polygon Containing a Hole"],"prefix":"10.1007","author":[{"given":"Graham M.","family":"Seed","sequence":"first","affiliation":[]},{"given":"Douglas E. R.","family":"Clark","sequence":"additional","affiliation":[]},{"given":"Raffaella","family":"Ocone","sequence":"additional","affiliation":[]},{"given":"Xiaoyan Y.","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"91_CR1","volume-title":"Computational Geometry in C","author":"J. ORourke","year":"1994","unstructured":"O\u2019Rourke, J.: Computational Geometry in C, Cambridge University Press. Cambridge (1994)"},{"key":"91_CR2","volume-title":"Graph Theory. Electronic Edition","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Electronic Edition, Springer-Verlag, New York (2000), \n                    http:\/\/www.math.uni-hamburg.de\/home\/diestel\/books\/graph.theory"},{"key":"91_CR3","first-page":"21","volume-title":"Proof Techniques in Graph Theory","author":"G. Chartland","year":"1969","unstructured":"Chartland, G. and Frechen, J. B.: On the Chromatic Number of Permutation Graphs. In: Harary, F. (ed.): Proof Techniques in Graph Theory, Proceedings of the Second Ann Arbor Graph Theory Conference, February 1968. Academic Press, New York (1969) 21\u201324"},{"key":"91_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"B70","author":"N. Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D. P., Seymour, P. D. and Thomas, R.: The Four Colour Theorem, J Combin Theory Ser, B70, 2\u201344 (1997)","journal-title":"J Combin Theory Ser"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2014 ICCSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44842-X_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:49:27Z","timestamp":1551070167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44842-X_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401568","9783540448426"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-44842-x_91","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}