{"id":"https://openalex.org/W2965854419","doi":"https://doi.org/10.24963/ijcai.2019/856","title":"Clause Learning and New Bounds for Graph Coloring","display_name":"Clause Learning and New Bounds for Graph Coloring","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2965854419","doi":"https://doi.org/10.24963/ijcai.2019/856","mag":"2965854419"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/856","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/856","pdf_url":"https://www.ijcai.org/proceedings/2019/0856.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2019/0856.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048982899","display_name":"Emmanuel H\u00e9brard","orcid":"https://orcid.org/0000-0003-3131-0709"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I17866349","display_name":"Universit\u00e9 F\u00e9d\u00e9rale de Toulouse Midi-Pyr\u00e9n\u00e9es","ror":"https://ror.org/004raaa70","country_code":"FR","type":"education","lineage":["https://openalex.org/I17866349"]},{"id":"https://openalex.org/I190497903","display_name":"Laboratoire d'Analyse et d'Architecture des Syst\u00e8mes","ror":"https://ror.org/03vcm6439","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I190497903","https://openalex.org/I193033237","https://openalex.org/I196454796","https://openalex.org/I205747304","https://openalex.org/I4210095849","https://openalex.org/I4210152422","https://openalex.org/I4210159245","https://openalex.org/I4405258862","https://openalex.org/I4405259414"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Emmanuel Hebrard","raw_affiliation_strings":["LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, France","institution_ids":["https://openalex.org/I17866349","https://openalex.org/I1294671590","https://openalex.org/I190497903"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026700325","display_name":"George Katsirelos","orcid":"https://orcid.org/0000-0002-3727-6698"},"institutions":[{"id":"https://openalex.org/I22248866","display_name":"AgroParisTech","ror":"https://ror.org/02kbmgc12","country_code":"FR","type":"education","lineage":["https://openalex.org/I22248866","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"George Katsirelos","raw_affiliation_strings":["UMR MIA-Paris, INRA, AgroParisTech, Universit\u00e9 Paris-Saclay, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMR MIA-Paris, INRA, AgroParisTech, Universit\u00e9 Paris-Saclay, Paris, France","institution_ids":["https://openalex.org/I22248866","https://openalex.org/I277688954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048982899"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I17866349","https://openalex.org/I190497903"],"apc_list":null,"apc_paid":null,"fwci":0.2058,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58922579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"6166","last_page":"6170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7931276559829712},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5970748066902161},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5796349048614502},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5515015125274658},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5337477922439575},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5323482155799866},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5116315484046936},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4844062924385071},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42616137862205505},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4241361618041992},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.4184153974056244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38004642724990845},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34128978848457336},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33553072810173035},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.24721848964691162},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1780838966369629},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.07351011037826538}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7931276559829712},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5970748066902161},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5796349048614502},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5515015125274658},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5337477922439575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5323482155799866},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5116315484046936},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4844062924385071},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42616137862205505},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4241361618041992},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.4184153974056244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38004642724990845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34128978848457336},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33553072810173035},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.24721848964691162},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1780838966369629},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.07351011037826538},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2019/856","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/856","pdf_url":"https://www.ijcai.org/proceedings/2019/0856.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/856","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/856","pdf_url":"https://www.ijcai.org/proceedings/2019/0856.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2965854419.pdf","grobid_xml":"https://content.openalex.org/works/W2965854419.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W203746830","https://openalex.org/W1530527290","https://openalex.org/W1546943373","https://openalex.org/W1561068705","https://openalex.org/W1988588521","https://openalex.org/W2003804316","https://openalex.org/W2013946649","https://openalex.org/W2030455524","https://openalex.org/W2044560939","https://openalex.org/W2118598328","https://openalex.org/W2119190805","https://openalex.org/W2130088495","https://openalex.org/W2141082967","https://openalex.org/W2167036627"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4291316360","https://openalex.org/W3169197204","https://openalex.org/W2585997002","https://openalex.org/W2380525562","https://openalex.org/W4229747356","https://openalex.org/W398688634","https://openalex.org/W2385428710","https://openalex.org/W1542397451","https://openalex.org/W2046652778"],"abstract_inverted_index":{"Graph":[0],"coloring":[1,20],"is":[2],"a":[3,14,32,68,86,97,101,110,114,129],"major":[4],"component":[5],"of":[6,80,104,125],"numerous":[7],"allocation":[8],"and":[9,35,51,113,135,147],"scheduling":[10],"problems.":[11],"We":[12,84],"introduce":[13,85],"hybrid":[15],"CP/SAT":[16],"approach":[17],"to":[18,78,99],"graph":[19],"based":[21,93],"on":[22,59,94,119,139],"exploring":[23],"Zykov\u2019s":[24],"tree:":[25],"for":[26,90,107,143,148],"two":[27,61],"non-neighbors,":[28],"either":[29],"they":[30,46],"take":[31,47],"different":[33],"color":[34,50,66],"there":[36],"might":[37,53],"as":[38,54,74],"well":[39,55],"be":[40],"an":[41],"edge":[42],"between":[43],"them,":[44],"or":[45],"the":[48,64,81,120],"same":[49,65],"we":[52],"merge":[56],"them.":[57],"Branching":[58],"whether":[60],"neighbors":[62],"get":[63],"yields":[67],"symmetry-free":[69],"tree":[70],"with":[71],"complete":[72],"graphs":[73],"leaves,":[75],"which":[76],"correspond":[77],"colorings":[79],"original":[82],"graph.":[83],"new":[87],"lower":[88,150],"bound":[89,106],"this":[91,105],"problem":[92],"Mycielskian":[95],"graphs;":[96],"method":[98],"produce":[100],"clausal":[102],"explanation":[103],"use":[108],"in":[109,128],"CDCL":[111],"algorithm;":[112],"branching":[115],"heuristic":[116],"emulating":[117],"Brelaz":[118],"Zykov":[121],"tree.":[122],"The":[123],"combination":[124],"these":[126],"techniques":[127],"branch-":[130],"and-bound":[131],"search":[132],"outperforms":[133],"Dsatur":[134],"other":[136],"SAT-based":[137],"approaches":[138],"standard":[140],"benchmarks":[141],"both":[142],"finding":[144],"upper":[145],"bounds":[146],"proving":[149],"bounds.":[151]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}