{"id":"https://openalex.org/W1529433769","doi":"https://doi.org/10.1016/s0020-0190(96)00190-1","title":"An algorithm for 3-colorable graphs","display_name":"An algorithm for 3-colorable graphs","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1529433769","doi":"https://doi.org/10.1016/s0020-0190(96)00190-1","mag":"1529433769"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(96)00190-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(96)00190-1","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/A5024803432","display_name":"Avrim Blum","orcid":"https://orcid.org/0000-0003-2450-5102"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Avrim Blum","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA","School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA;"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA;","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Karger","raw_affiliation_strings":["Laboratory for Computer Science, MIT, Cambridge, MA 02139, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, MIT, Cambridge, MA 02139, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024803432"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":5.6881,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.96063498,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"61","issue":"1","first_page":"49","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9822999835014343,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9336000084877014,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6875625848770142},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5604029893875122},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5106387734413147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49144113063812256},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4504309296607971},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4222910404205322},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3821164667606354},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35838091373443604}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6875625848770142},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5604029893875122},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5106387734413147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49144113063812256},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4504309296607971},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4222910404205322},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3821164667606354},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35838091373443604}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(96)00190-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(96)00190-1","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1572977974","https://openalex.org/W1982506822","https://openalex.org/W1991006936","https://openalex.org/W2036660814","https://openalex.org/W2041605864","https://openalex.org/W2104254886","https://openalex.org/W2162018802","https://openalex.org/W6634222898","https://openalex.org/W6648048595","https://openalex.org/W6668302662","https://openalex.org/W6675809563"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W1519201794","https://openalex.org/W2157169356","https://openalex.org/W1629505938","https://openalex.org/W2767824041"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}