{"id":"https://openalex.org/W2053495905","doi":"https://doi.org/10.1142/s0219265911002861","title":"WEIGHTED-EDGE-COLORING OF k-DEGENERATE GRAPHS AND BIN-PACKING","display_name":"WEIGHTED-EDGE-COLORING OF k-DEGENERATE GRAPHS AND BIN-PACKING","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2053495905","doi":"https://doi.org/10.1142/s0219265911002861","mag":"2053495905"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265911002861","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265911002861","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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/A5063510852","display_name":"Florian Huc","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"FLORIAN HUC","raw_affiliation_strings":["LPD, EPFL Station 14, CH-1015 Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LPD, EPFL Station 14, CH-1015 Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063510852"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12410737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"01n02","first_page":"109","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9980000257492065,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/combinatorics","display_name":"Combinatorics","score":0.8660023212432861},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7908892035484314},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.7123263478279114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6978968977928162},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5750739574432373},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5552376508712769},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.49055808782577515},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43925046920776367},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4173853397369385},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41676002740859985},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.13422256708145142},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11378443241119385}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8660023212432861},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7908892035484314},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.7123263478279114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6978968977928162},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5750739574432373},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5552376508712769},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.49055808782577515},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43925046920776367},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4173853397369385},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41676002740859985},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.13422256708145142},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11378443241119385}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265911002861","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265911002861","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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":18,"referenced_works":["https://openalex.org/W1972256863","https://openalex.org/W2009828849","https://openalex.org/W2017216075","https://openalex.org/W2019973212","https://openalex.org/W2024071268","https://openalex.org/W2025328375","https://openalex.org/W2046229563","https://openalex.org/W2062207559","https://openalex.org/W2064810366","https://openalex.org/W2078691045","https://openalex.org/W2090785779","https://openalex.org/W2096313289","https://openalex.org/W2098488162","https://openalex.org/W2131019198","https://openalex.org/W2145028977","https://openalex.org/W2611804663","https://openalex.org/W4237496336","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4291316360","https://openalex.org/W3169197204","https://openalex.org/W1542397451","https://openalex.org/W4229747356","https://openalex.org/W2380525562","https://openalex.org/W4297911588","https://openalex.org/W2385428710","https://openalex.org/W2585997002","https://openalex.org/W398688634"],"abstract_inverted_index":{"The":[0],"weighted-edge-coloring":[1],"problem":[2],"of":[3,32,34,80,83,86,134,157],"an":[4],"edge-weighted":[5,99,125],"graph":[6,106],"whose":[7,104],"weights":[8,33,85],"are":[9,67],"between":[10],"0":[11],"and":[12,25,40,54,118],"1,":[13],"consists":[14],"in":[15],"finding":[16],"a":[17,91,108,131,154],"coloring":[18,136,152],"using":[19],"as":[20,23],"few":[21],"colors":[22,66],"possible":[24],"satisfying":[26],"the":[27,30,37,43,78,81,84,87,120,139,150,160],"following":[28],"constraints:":[29],"sum":[31],"edges":[35,88,103],"with":[36,101,138],"same":[38,44],"color":[39],"incident":[41,89],"to":[42,70,90,115,145],"vertex":[45],"must":[46],"be":[47],"at":[48],"most":[49],"1.":[50],"In":[51],"1991,":[52],"Chung":[53],"Ross":[55],"conjectured":[56],"that":[57],"if":[58],"G":[59],"is":[60,77,96,107],"bipartite,":[61],"then":[62],"[Formula:":[63,74],"see":[64,75],"text]":[65,76],"always":[68],"sufficient":[69],"weighted-edge-color":[71],"(G,w),":[72],"where":[73],"maximum":[79],"sums":[82],"vertex.":[92],"We":[93,110],"prove":[94,119],"this":[95,113,135],"true":[97],"for":[98,123,153],"graphs":[100,117],"multiple":[102],"underlying":[105],"tree.":[109],"further":[111],"generalise":[112],"conjecture":[114,122],"non-bipartite":[116],"generalised":[121],"simple":[124],"outerplanar":[126],"graphs.":[127],"Finally,":[128],"we":[129],"introduce":[130],"list":[132],"version":[133],"together":[137],"list-bin-packing":[140],"problem,":[141],"which":[142],"allows":[143],"us":[144],"obtain":[146],"new":[147],"results":[148],"concerning":[149],"original":[151],"specific":[155],"class":[156],"graphs,":[158],"namely":[159],"k-weight-degenerate":[161],"weighted":[162],"graph.":[163]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}