{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:57Z","timestamp":1725455577097},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024484","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"15-24","source":"Crossref","is-referenced-by-count":3,"title":["On the number of simple cycles in planar graphs"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Fuchs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"M. Blum, C. Hewitt, Automata on a 2-dimensional tape, 8th IEEE Conf. on SWAT, 1967, 155\u2013160.","DOI":"10.1109\/FOCS.1967.6"},{"issue":"3","key":"3_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01261319","volume":"16","author":"G. Ding","year":"1996","unstructured":"G. Ding, Bounding the Number of Circuits of a Graph, Combinatorica 16(3), 1996, 331\u2013341.","journal-title":"Combinatorica"},{"key":"3_CR3","unstructured":"D. Eppstein, Pesonal Communications, 1997"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"U. F\u00f6ssmeier, M. Kaufmann, On Exact Solutions for the Rectilinear Steiner Problem, Part I: Theoretical Results, Technical Report, Computer Science Institute, Universit\u00e4t T\u00fcbingen, 1996.","DOI":"10.1145\/262839.263071"},{"key":"3_CR5","first-page":"332","volume":"24","author":"P. J. Heawood","year":"1890","unstructured":"P. J. Heawood, Map Color Theorem, Quarterly Journal of Pure and Applied Mathematics 24, 1890, 332\u2013338.","journal-title":"Quarterly Journal of Pure and Applied Mathematics"},{"key":"3_CR6","volume-title":"Graph Coloring Problems","author":"T. R. Jensen","year":"1995","unstructured":"T. R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995."},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-5060(08)70391-1","volume":"55","author":"R. Steinberg","year":"1993","unstructured":"R. Steinberg, The State of the Three Color Problem, Annals of Discrete Mathematics 55, 1993, 211\u2013248.","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:35:23Z","timestamp":1586568923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0024484","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}