{"id":"https://openalex.org/W4213194823","doi":"https://doi.org/10.1016/0168-0072(89)90037-7","title":"On the complexity of finding the chromatic number of a recursive graph II: the unbounded case","display_name":"On the complexity of finding the chromatic number of a recursive graph II: the unbounded case","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W4213194823","doi":"https://doi.org/10.1016/0168-0072(89)90037-7"},"language":"en","primary_location":{"id":"doi:10.1016/0168-0072(89)90037-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0168-0072(89)90037-7","pdf_url":null,"source":{"id":"https://openalex.org/S172477885","display_name":"Annals of Pure and Applied Logic","issn_l":"0168-0072","issn":["0168-0072","1873-2461"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Pure and Applied Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078715930","display_name":"Richard Beigel","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Beigel","raw_affiliation_strings":["Department of Computer Science, The John Hopkins University, Baltimore, MD 21218, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The John Hopkins University, Baltimore, MD 21218, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089274175","display_name":"William Gasarch","orcid":"https://orcid.org/0000-0003-3698-5991"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William I. Gasarch","raw_affiliation_strings":["Department of Computer Science, Institute for Advanced Study, University of Maryland, College Park, MD 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Institute for Advanced Study, University of Maryland, College Park, MD 20742, USA","institution_ids":["https://openalex.org/I40036882","https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3390,"currency":"USD","value_usd":3390},"apc_paid":null,"fwci":1.5206,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.87210344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"45","issue":"3","first_page":"227","last_page":"246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6802798509597778},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.6155447363853455},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5374634265899658},{"id":"https://openalex.org/keywords/critical-graph","display_name":"Critical graph","score":0.5291029810905457},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5249452590942383},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4981858730316162},{"id":"https://openalex.org/keywords/friendship-graph","display_name":"Friendship graph","score":0.44372472167015076},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.21918192505836487},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1973799467086792}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6802798509597778},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.6155447363853455},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5374634265899658},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.5291029810905457},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5249452590942383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4981858730316162},{"id":"https://openalex.org/C70488441","wikidata":"https://www.wikidata.org/wiki/Q5504427","display_name":"Friendship graph","level":5,"score":0.44372472167015076},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.21918192505836487},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1973799467086792}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0168-0072(89)90037-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0168-0072(89)90037-7","pdf_url":null,"source":{"id":"https://openalex.org/S172477885","display_name":"Annals of Pure and Applied Logic","issn_l":"0168-0072","issn":["0168-0072","1873-2461"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Pure and Applied Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.1301","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.1301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~gasarch/forweb/bdq_chromu.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1975489634","https://openalex.org/W1988287732","https://openalex.org/W1989008275","https://openalex.org/W2008839847","https://openalex.org/W2027679733","https://openalex.org/W2067489791","https://openalex.org/W2321852024","https://openalex.org/W2905135108","https://openalex.org/W4231402170","https://openalex.org/W6649112680","https://openalex.org/W6835595159"],"related_works":["https://openalex.org/W2049992750","https://openalex.org/W2951887113","https://openalex.org/W2091414672","https://openalex.org/W2804029448","https://openalex.org/W2562183448","https://openalex.org/W3120282738","https://openalex.org/W2057367302","https://openalex.org/W2390298591","https://openalex.org/W4240570119","https://openalex.org/W1977559902"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}