{"id":"https://openalex.org/W2600945321","doi":"https://doi.org/10.1145/3001582","title":"Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors","display_name":"Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors","publication_year":2017,"publication_date":"2017-02-28","ids":{"openalex":"https://openalex.org/W2600945321","doi":"https://doi.org/10.1145/3001582","mag":"2600945321"},"language":"en","primary_location":{"id":"doi:10.1145/3001582","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3001582","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5008961593","display_name":"Ken\u2010ichi Kawarabayashi","orcid":"https://orcid.org/0000-0001-6056-4287"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Ken-Ichi Kawarabayashi","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008961593"],"corresponding_institution_ids":["https://openalex.org/I184597095"],"apc_list":null,"apc_paid":null,"fwci":2.3644,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.89599969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"64","issue":"1","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9968000054359436,"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.9968000054359436,"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.9905999898910522,"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.9534000158309937,"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.727663516998291},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6813063621520996},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5866851806640625},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.4894241392612457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4798402488231659},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4452110528945923},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44381487369537354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4351697862148285},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4342940151691437},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.4288964569568634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3888811469078064},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3841632604598999},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23482292890548706},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11104393005371094}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.727663516998291},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6813063621520996},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5866851806640625},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.4894241392612457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4798402488231659},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4452110528945923},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44381487369537354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4351697862148285},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4342940151691437},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.4288964569568634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3888811469078064},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3841632604598999},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23482292890548706},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11104393005371094},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3001582","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3001582","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/e069c06a-89ca-4faa-8dae-9107fb8241c7","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/e069c06a-89ca-4faa-8dae-9107fb8241c7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kawarabayashi , K & Thorup , M 2017 , ' Coloring 3-colorable graphs with less than n 1/5 \u00a0colors ' , Journal of the ACM , vol. 64 , no. 1 , 4 . https://doi.org/10.1145/3001582","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338112","display_name":"Exploratory Research for Advanced Technology","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1529433769","https://openalex.org/W1947552815","https://openalex.org/W1969999211","https://openalex.org/W1982506822","https://openalex.org/W1985123706","https://openalex.org/W2030087828","https://openalex.org/W2036660814","https://openalex.org/W2043963325","https://openalex.org/W2047861934","https://openalex.org/W2058422149","https://openalex.org/W2069816168","https://openalex.org/W2081254453","https://openalex.org/W2088844265","https://openalex.org/W2092913540","https://openalex.org/W2099022556","https://openalex.org/W2101644337","https://openalex.org/W2103935895","https://openalex.org/W2104254886","https://openalex.org/W2127819793","https://openalex.org/W2166278581","https://openalex.org/W3003311325"],"related_works":["https://openalex.org/W4297911588","https://openalex.org/W4291316360","https://openalex.org/W183100298","https://openalex.org/W4311345810","https://openalex.org/W2793500002","https://openalex.org/W1542397451","https://openalex.org/W2546620014","https://openalex.org/W2585997002","https://openalex.org/W3169197204","https://openalex.org/W4298054421"],"abstract_inverted_index":{"We":[0,18],"consider":[1],"the":[2,34,63,67,72],"problem":[3],"of":[4,74],"coloring":[5,73],"a":[6,21,98],"3-colorable":[7,75],"graph":[8],"in":[9],"polynomial":[10,68],"time":[11,69],"using":[12,25],"as":[13,16],"few":[14],"colors":[15,83],"possible.":[17],"first":[19,35],"present":[20],"new":[22,52,99],"combinatorial":[23,36],"algorithm":[24,53,70],"\u00d5":[26,40],"(":[27,41,79,90,113],"n":[28,42,80,91,114],"4/11":[29],")":[30,44,82,93,116],"colors.":[31,94,117],"This":[32],"is":[33],"improvement":[37],"since":[38],"Blum\u2019s":[39,49],"3/8":[43],"bound":[45,65],"from":[46,77,86],"FOCS\u201990.":[47],"Like":[48],"algorithm,":[50],"our":[51],"composes":[54],"immediately":[55],"with":[56,104],"recent":[57],"semi-definite":[58,105],"programming":[59],"approaches,":[60,106],"and":[61],"improves":[62],"best":[64],"for":[66,71,102],"graphs":[76],"O":[78,89,112],"0.2072":[81],"by":[84],"Chlamtac":[85],"FOCS\u201907":[87],"to":[88,111],"0.2049":[92],"Next,":[95],"we":[96],"develop":[97],"recursion":[100],"tailored":[101],"combination":[103],"bringing":[107],"us":[108],"further":[109],"down":[110],"0.19996":[115]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2017,"cited_by_count":2}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}