{"id":"https://openalex.org/W2134026641","doi":"https://doi.org/10.1017/cbo9781139519793.016","title":"Graph colouring algorithms","display_name":"Graph colouring algorithms","publication_year":2015,"publication_date":"2015-05-05","ids":{"openalex":"https://openalex.org/W2134026641","doi":"https://doi.org/10.1017/cbo9781139519793.016","mag":"2134026641"},"language":"en","primary_location":{"id":"doi:10.1017/cbo9781139519793.016","doi":"https://doi.org/10.1017/cbo9781139519793.016","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9781139519793.016","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Topics in Chromatic Graph Theory","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W1856998012","display_name":"Topics in Chromatic Graph Theory"},"type":"book-chapter","is_traditional":true,"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/A5041727204","display_name":"Thore Husfeldt","orcid":"https://orcid.org/0000-0001-9078-4512","observed_orcids":["https://orcid.org/0000-0001-9078-4512"]},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Thore Husfeldt","raw_affiliation_strings":["Aarhus University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041727204"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":1.1583,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.77402746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"303"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7544000148773193,"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.7544000148773193,"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.11029999703168869,"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.10769999772310257,"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/graph-coloring","display_name":"graph coloring","score":0.996999979019165},{"id":"https://openalex.org/keywords/vertex-coloring","display_name":"vertex coloring","score":0.9819999933242798},{"id":"https://openalex.org/keywords/exhaustive-search","display_name":"exhaustive search","score":0.7739999890327454},{"id":"https://openalex.org/keywords/worst-case-performance-guarantees","display_name":"worst-case guarantees","score":0.7699999809265137},{"id":"https://openalex.org/keywords/sequential-algorithms","display_name":"sequential algorithms","score":0.7950000166893005},{"id":"https://openalex.org/keywords/models-of-computation","display_name":"models of computation","score":0.6990000009536743},{"id":"https://openalex.org/keywords/runtime-analysis","display_name":"runtime analysis","score":0.7070000171661377},{"id":"https://openalex.org/keywords/algorithmic-paradigms","display_name":"algorithmic paradigms","score":0.6660000085830688}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6659655570983887},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.6122811436653137},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5867811441421509},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5505530834197998},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5189366340637207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4881077706813812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4801768362522125}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/cbo9781139519793.016","doi":"https://doi.org/10.1017/cbo9781139519793.016","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9781139519793.016","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Topics in Chromatic Graph Theory","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W12802409","https://openalex.org/W65989689","https://openalex.org/W163386900","https://openalex.org/W332343848","https://openalex.org/W621909926","https://openalex.org/W1492972816","https://openalex.org/W1505629771","https://openalex.org/W1524920060","https://openalex.org/W1533811829","https://openalex.org/W1540529426","https://openalex.org/W1966769222","https://openalex.org/W1981360277","https://openalex.org/W1981455469","https://openalex.org/W1982506822","https://openalex.org/W1988642505","https://openalex.org/W2007200873","https://openalex.org/W2013568176","https://openalex.org/W2032055415","https://openalex.org/W2032146159","https://openalex.org/W2066356146","https://openalex.org/W2069816168","https://openalex.org/W2074359677","https://openalex.org/W2085716675","https://openalex.org/W2092653160","https://openalex.org/W2094122556","https://openalex.org/W2096833188","https://openalex.org/W2100440346","https://openalex.org/W2101644337","https://openalex.org/W2102669784","https://openalex.org/W2107527022","https://openalex.org/W2108301529","https://openalex.org/W2112575355","https://openalex.org/W2116007667","https://openalex.org/W2126186592","https://openalex.org/W2133732980","https://openalex.org/W2153584512","https://openalex.org/W2160429376","https://openalex.org/W2166278581","https://openalex.org/W2167036627","https://openalex.org/W2401610261","https://openalex.org/W2491570760","https://openalex.org/W2500069809","https://openalex.org/W2578759464","https://openalex.org/W2610183793","https://openalex.org/W3111890340","https://openalex.org/W3156756105"],"related_works":["https://openalex.org/W1995231650","https://openalex.org/W2555826601","https://openalex.org/W2884980399","https://openalex.org/W2018458434","https://openalex.org/W2114148358","https://openalex.org/W2007033386","https://openalex.org/W140158205","https://openalex.org/W7099870388","https://openalex.org/W7162201796","https://openalex.org/W6922833539"],"abstract_inverted_index":{"This":[0,160,329],"chapter":[1],"presents":[2],"an":[3,93,179,305],"introduction":[4],"to":[5,35,61,72,181,262,333],"graph":[6,59,100,301],"colouring":[7],"algorithms.":[8,192],"The":[9,32],"focus":[10],"is":[11,43,60,302],"on":[12],"vertex-colouring":[13,56,109],"algorithms":[14],"that":[15,247,298],"work":[16],"for":[17,53],"general":[18],"classes":[19],"of":[20,30,39,57,70,75,194,207,233,307,338],"graphs":[21],"with":[22,102,154],"worst-case":[23],"performance":[24],"guarantees":[25],"in":[26,186,267,284,341],"a":[27,55,58,77,99,108,239,244,339],"sequential":[28],"model":[29,246],"computation.":[31],"presentation":[33],"aims":[34],"demonstrate":[36],"the":[37,68,73,157,184,205,230,234,299,312,319,336],"breadth":[38],"available":[40],"techniques":[41],"and":[42,98,201],"organized":[44],"by":[45,210,217,304,310],"algorithmic":[46],"paradigm":[47],".":[48,116],"Introduction":[49],"A":[50,261,274],"straightforward":[51],"algorithm":[52,106,161],"finding":[54],"search":[62,90],"systematically":[63],"among":[64],"all":[65,255,282],"mappings":[66,256],"from":[67,257],"set":[69,74,260,265],"vertices":[71,200,321],"colours,":[76],"technique":[78],"often":[79],"called":[80],"exhaustive":[81],"or":[82,279],"brute":[83],"force":[84],":":[85,124],"Algorithm":[86,211],"X":[87,212],"(":[88,145,150,219,222,287,323],"Exhaustive":[89],")":[91,147,276,291],"Given":[92],"integer":[94],"q":[95,111,130,220],"\u2265":[96],"1":[97],"G":[101,197],"vertexset":[103],"V,":[104],"this":[105],"finds":[107],"using":[110],"colours":[112],"if":[113],"one":[114,258],"exists":[115],"X1":[117],"[Main":[118],"loop]":[119],"For":[120,294],"each":[121],"mapping":[122],"f":[123,137,144,149,155],"V":[125],"\u2192":[126],"{1,":[127],"2,":[128],"\u2026,":[129],"},":[131],"do":[132],"Step":[133],"X2.":[134],"X2":[135],"[Check":[136],"]":[138],"If":[139,196],"every":[140],"edge":[141],"vw":[142],"satisfies":[143],"v":[146,317,324,345],"\u2260":[148],"w":[151],"),":[152,325],"terminate":[153],"as":[156,178,252],"result.":[158],"\u25aa":[159],"has":[162,198],"few":[163],"redeeming":[164],"qualities,":[165],"other":[166],"than":[167],"its":[168],"being":[169],"correct.":[170],"We":[171],"consider":[172],"it":[173,176],"here":[174],"because":[175],"serves":[177],"opportunity":[180],"make":[182,237],"explicit":[183],"framework":[185],"which":[187,227],"we":[188,228,241,296],"present":[189],"more":[190],"interesting":[191],"Model":[193],"computation":[195],"n":[199,221,223,288],"m":[202,225,290],"edges,":[203],"then":[204],"number":[206],"operations":[208],"used":[209],"can":[213],"be":[214],"asymptotically":[215],"bounded":[216],"O":[218,269,286,343],"+":[224,289],")),":[226],"call":[229],"running":[231],"time":[232,268,285,342],"algorithm.":[235],"To":[236],"such":[238,251],"claim,":[240],"tacitly":[242],"assume":[243,297],"computational":[245],"includes":[248],"primitive":[249],"operations,":[250],"iterating":[253,280],"over":[254,281,335],"finite":[259,264],"another":[263],"B":[266,271],"(|":[270],"|":[272,273,275],"(Step":[277,292],"X1),":[278],"edges":[283],"X2).":[293],"instance,":[295],"input":[300],"represented":[303],"array":[306],"sequences":[308],"indexed":[309],"vertices;":[311],"sequence":[313],"stored":[314],"at":[315],"vertex":[316,340],"contains":[318],"neighouring":[320],"N":[322],"see":[326],"Fig.":[327],"1.":[328],"representation":[330],"allows":[331],"us":[332],"iterate":[334],"neighbours":[337],"(deg":[344],").":[346]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}