{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:04:10Z","timestamp":1648677850001},"reference-count":13,"publisher":"Elsevier BV","issue":"18","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1016\/j.ipl.2013.06.006","type":"journal-article","created":{"date-parts":[[2013,6,28]],"date-time":"2013-06-28T02:17:10Z","timestamp":1372385830000},"page":"685-689","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Edge-coloring almost bipartite multigraphs"],"prefix":"10.1016","volume":"113","author":[{"given":"Tom\u00e1s","family":"Feder","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Subi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2013.06.006_br0010","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/j.ipl.2013.06.006_br0020","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0095-8956(86)90065-1","article-title":"The chromatic index of nearly bipartite multigraphs","volume":"40","author":"Eggan","year":"1986","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.ipl.2013.06.006_br0030","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF01261320","article-title":"List edge colourings of some 1-factorable multigraphs","volume":"16","author":"Ellingham","year":"1996","journal-title":"Combinatorica"},{"key":"10.1016\/j.ipl.2013.06.006_br0040","article-title":"Stable networks and product graphs","volume":"555","author":"Feder","year":"1995","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/j.ipl.2013.06.006_br0050","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/j.ipl.2013.06.006_br0060","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jctb.1995.1011","article-title":"The list chromatic index of a bipartite multigraph","volume":"63","author":"Galvin","year":"1995","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.ipl.2013.06.006_br0070","series-title":"The Stable Marriage Problem: Structure and Algorithms","author":"Gusfield","year":"1989"},{"key":"10.1016\/j.ipl.2013.06.006_br0080","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1017\/S0963548397002927","article-title":"New bounds on the list-chromatic index of the complete graph and other simple graphs","volume":"6","author":"H\u00e4ggkvist","year":"1997","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ipl.2013.06.006_br0090","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ipl.2013.06.006_br0100","first-page":"157","article-title":"On the list chromatic index of nearly bipartite multigraphs","volume":"19","author":"Plantholt","year":"1999","journal-title":"Aust. J. Combin."},{"key":"10.1016\/j.ipl.2013.06.006_br0110","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/jctb.1997.1752","article-title":"Tutte\u02bcs edge-colouring conjecture","volume":"70","author":"Robertson","year":"1997","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.ipl.2013.06.006_br0120","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1017\/S0963548300001851","article-title":"Short proof of Galvin\u02bcs theorem on the list-chromatic index of a bipartite multigraph","volume":"5","author":"Slivnik","year":"1996","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ipl.2013.06.006_br0130","series-title":"Edge-choosability of cubic graphs and the polynomial method","author":"Spencer","year":"2010"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019013001737?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019013001737?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,14]],"date-time":"2018-10-14T19:56:17Z","timestamp":1539546977000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019013001737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":13,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["S0020019013001737"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2013.06.006","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2013,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Edge-coloring almost bipartite multigraphs","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2013.06.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}