{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:31:33Z","timestamp":1757626293645,"version":"3.44.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,9,9]],"date-time":"2003-09-09T00:00:00Z","timestamp":1063065600000},"content-version":"vor","delay-in-days":5030,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0168-0072(89)90037-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T07:49:29Z","timestamp":1034063369000},"page":"227-246","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["On the complexity of finding the chromatic number of a recursive graph II: the unbounded case"],"prefix":"10.1016","volume":"45","author":[{"given":"Richard","family":"Beigel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William I.","family":"Gasarch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(89)90037-7_BIB1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2307\/2272247","article-title":"Effective coloration","volume":"41","author":"Bean","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(89)90037-7_BIB2","unstructured":"R.J. Beigel, Unbounded searching algorithms, SIAM J. Comput., to appear."},{"key":"10.1016\/0168-0072(89)90037-7_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(89)90029-8","article-title":"On the complexity of finding the chromatic number of a recursive graph I: the bounded case","volume":"45","author":"Beigel","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(89)90037-7_BIB4","series-title":"TR-1806","article-title":"Terse, superterse, and verbose sets","author":"Beigel","year":"1987"},{"key":"10.1016\/0168-0072(89)90037-7_BIB5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","article-title":"An almost algorithm for unbounded searching","volume":"5","author":"Bentley","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0168-0072(89)90037-7_BIB6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0168-0072(83)90052-0","article-title":"Recursive coloration of countable graphs","volume":"25","author":"Carstens","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"year":"1968","series-title":"Information Theory and Reliable Communication","author":"Gallagher","key":"10.1016\/0168-0072(89)90037-7_BIB7"},{"key":"10.1016\/0168-0072(89)90037-7_BIB8","series-title":"The Mathematical Gardener","first-page":"310","article-title":"Supernatural numbers","author":"Knuth","year":"1981"},{"key":"10.1016\/0168-0072(89)90037-7_BIB9","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging, and sorting in parallel computation","volume":"32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Computers"},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/0168-0072(89)90037-7_BIB10"},{"key":"10.1016\/0168-0072(89)90037-7_BIB11","doi-asserted-by":"crossref","first-page":"821","DOI":"10.4153\/CJM-1980-062-7","article-title":"Recursive colorings of graphs","volume":"32","author":"Schmerl","year":"1980","journal-title":"Canad. J. Math."},{"year":"1987","series-title":"Recursively Enumerable Sets and Degrees, Omega Series","author":"Soare","key":"10.1016\/0168-0072(89)90037-7_BIB12"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007289900377?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007289900377?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:39:28Z","timestamp":1757453968000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007289900377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0168007289900377"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(89)90037-7","relation":{},"ISSN":["0168-0072"],"issn-type":[{"type":"print","value":"0168-0072"}],"subject":[],"published":{"date-parts":[[1989,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the complexity of finding the chromatic number of a recursive graph II: the unbounded case","name":"articletitle","label":"Article Title"},{"value":"Annals of Pure and Applied Logic","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0168-0072(89)90037-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}