{"id":"https://openalex.org/W2043646993","doi":"https://doi.org/10.1016/0020-0190(89)90075-6","title":"An algorithm for colouring perfect planar graphs","display_name":"An algorithm for colouring perfect planar graphs","publication_year":1989,"publication_date":"1989-04-01","ids":{"openalex":"https://openalex.org/W2043646993","doi":"https://doi.org/10.1016/0020-0190(89)90075-6","mag":"2043646993"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(89)90075-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(89)90075-6","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5061350983","display_name":"Iain A. Stewart","orcid":"https://orcid.org/0000-0002-0752-1971"},"institutions":[{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Iain A. Stewart","raw_affiliation_strings":["Computing Laboratory, University of Newcastle Upon Tyne, Claremont Road, Newcastle Upon Tyne,England NE1 7RU","Computing Laboratory, University of Newcastle-upon-Tyne, Newcastle-upon-Tyne, England"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, University of Newcastle Upon Tyne, Claremont Road, Newcastle Upon Tyne,England NE1 7RU","institution_ids":["https://openalex.org/I84884186"]},{"raw_affiliation_string":"Computing Laboratory, University of Newcastle-upon-Tyne, Newcastle-upon-Tyne, England","institution_ids":["https://openalex.org/I84884186"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061350983"],"corresponding_institution_ids":["https://openalex.org/I84884186"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.18517459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"2","first_page":"97","last_page":"101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9871000051498413,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9871000051498413,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9722999930381775,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.965499997138977,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/algorithm","display_name":"Algorithm","score":0.6799347996711731},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6050326228141785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5076562166213989},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5069751739501953},{"id":"https://openalex.org/keywords/analysis-of-algorithms","display_name":"Analysis of algorithms","score":0.48291370272636414},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.45108988881111145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4509609639644623},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4402490556240082},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4197615385055542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29030096530914307}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6799347996711731},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6050326228141785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5076562166213989},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5069751739501953},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.48291370272636414},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.45108988881111145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4509609639644623},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4402490556240082},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4197615385055542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29030096530914307},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(89)90075-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(89)90075-6","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1971010556","https://openalex.org/W2030087828","https://openalex.org/W2031198637","https://openalex.org/W2035874075","https://openalex.org/W2038643780","https://openalex.org/W2052056934","https://openalex.org/W2058660326","https://openalex.org/W2065306274","https://openalex.org/W2075256009","https://openalex.org/W2143474538","https://openalex.org/W2320198223","https://openalex.org/W6658427351"],"related_works":["https://openalex.org/W4206327962","https://openalex.org/W2010009304","https://openalex.org/W1996851061","https://openalex.org/W3021694725","https://openalex.org/W2025195393","https://openalex.org/W3216105633","https://openalex.org/W2990956612","https://openalex.org/W4293401121","https://openalex.org/W2891976289","https://openalex.org/W4231916799"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}