{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T09:48:11Z","timestamp":1762249691615,"version":"3.44.0"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:00:00Z","timestamp":1721001600000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1016\/j.dam.2020.03.044","type":"journal-article","created":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T07:26:41Z","timestamp":1585985201000},"page":"268-283","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Edge-colouring graphs with bounded local degree sums"],"prefix":"10.1016","volume":"281","author":[{"given":"L.M.","family":"Zatesko","sequence":"first","affiliation":[]},{"given":"A.","family":"Zorzi","sequence":"additional","affiliation":[]},{"given":"R.","family":"Carmo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5449-5393","authenticated-orcid":false,"given":"A.L.P.","family":"Guedes","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2020.03.044_b1","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1016\/j.disc.2011.09.035","article-title":"Some criteria for a graph to be class 1","volume":"312","author":"Akbari","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.03.044_b2","article-title":"The chromatic index of a graph whose core has maximum degree 2","volume":"19","author":"Akbari","year":"2012","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2020.03.044_b3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(73)90023-X","article-title":"On the edge-chromatic number of a graph","volume":"5","author":"Beineke","year":"1973","journal-title":"Discrete Math."},{"year":"2001","series-title":"Random Graphs","author":"Bollob\u00e1s","key":"10.1016\/j.dam.2020.03.044_b4"},{"key":"10.1016\/j.dam.2020.03.044_b5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0166-218X(91)90010-T","article-title":"NP-Completeness of edge-colouring some restricted graphs","volume":"30","author":"Cai","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.03.044_b6","doi-asserted-by":"crossref","DOI":"10.37236\/1699","article-title":"Colouring the petals of a graph","volume":"10","author":"Cariolaro","year":"2003","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2020.03.044_b7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190080403","article-title":"The chromatic index of graphs of even order with many edges","volume":"8","author":"Chetwynd","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2020.03.044_b8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1017\/S030500410006610X","article-title":"Star multigraphs with three vertices of maximum degree","volume":"100","author":"Chetwynd","year":"1986","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.dam.2020.03.044_b9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-5060(08)70453-9","article-title":"The edge-chromatic class of graphs with maximum degree at least |V|\u22123","volume":"41","author":"Chetwynd","year":"1988","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.dam.2020.03.044_b10","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.endm.2015.07.072","article-title":"On the chromatic index of cographs and join graphs","volume":"50","author":"Cunha Lima","year":"2015","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.dam.2020.03.044_b11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.tcs.2007.07.046","article-title":"Edge-colouring of regular graphs of large degree","volume":"389","author":"De Simone","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2020.03.044_b12","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10878-009-9235-8","article-title":"Edge-colouring of join of regular graphs","volume":"18","author":"De Simone","year":"2009","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2020.03.044_b13","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/s10878-011-9420-4","article-title":"Edge-colouring of joins of regular graphs II","volume":"25","author":"De Simone","year":"2013","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2020.03.044_b14","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.tcs.2005.12.010","article-title":"Edge-colouring of join graphs","volume":"355","author":"De Simone","year":"2006","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2020.03.044_b15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0095-8956(77)90039-9","article-title":"On the chromatic index of almost all graphs","volume":"23","author":"Erd\u0151s","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2020.03.044_b16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0020-0190(99)00050-2","article-title":"Total-chromatic number and chromatic index of dually chordal graphs","volume":"70","author":"Figueiredo","year":"1999","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.dam.2020.03.044_b17","first-page":"561","article-title":"Edge colorings in bipartite graphs","author":"Folkman","year":"1969","journal-title":"Comb. Math. Appl."},{"key":"10.1016\/j.dam.2020.03.044_b18","first-page":"437","article-title":"M\u00e9thode et th\u00e9or\u00e8me g\u00e9n\u00e9rale de coloration des ar\u00eates","volume":"56","author":"Fournier","year":"1977","journal-title":"J. Math. Pures Appl."},{"year":"1973","series-title":"Graphical Enumeration","author":"Harary","key":"10.1016\/j.dam.2020.03.044_b19"},{"key":"10.1016\/j.dam.2020.03.044_b20","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(92)90598-A","article-title":"The chromatic index of a graph whose core has maximum degree two","volume":"101","author":"Hilton","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.03.044_b21","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/S0305004100067244","article-title":"Graphs which are vertex-critical with respect to the edge-chromatic number","volume":"102","author":"Hilton","year":"1987","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.dam.2020.03.044_b22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/jgt.3190160207","article-title":"The chromatic index of complete multipartite graphs","volume":"16","author":"Hoffman","year":"1992","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.dam.2020.03.044_b23","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-colouring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2020.03.044_b24","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/00029890.1975.11993805","article-title":"Infinite families of non-trivial trivalent graphs which are not tait-colorable","volume":"82","author":"Isaacs","year":"1975","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/j.dam.2020.03.044_b25","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/j.dam.2020.03.044_b26","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0096-3003(96)00021-5","article-title":"The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3","volume":"93","author":"Koreas","year":"1997","journal-title":"J. Appl. Math. Comput."},{"key":"10.1016\/j.dam.2020.03.044_b27","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1016\/j.dam.2009.01.009","article-title":"Decompositions for edge-coloring join graphs and cobipartite graphs","volume":"158","author":"Machado","year":"2010","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.03.044_b28","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0166-218X(94)90101-5","article-title":"How to find overfull subgraphs in graphs with large maximum degree","volume":"51","author":"Niessen","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.03.044_b29","article-title":"How to find overfull subgraphs in graphs with large maximum degree","volume":"8","author":"Niessen","year":"2001","journal-title":"II, Electron. J. Combin."},{"key":"10.1016\/j.dam.2020.03.044_b30","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","article-title":"Odd minimum cut-sets and b-matching","volume":"7","author":"Padberg","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.dam.2020.03.044_b31","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/jgt.3190050103","article-title":"The chromatic index of graphs with a spanning star","volume":"5","author":"Plantholt","year":"1981","journal-title":"J. Graph Theory"},{"year":"2012","series-title":"Graph Edge Coloring: Vizing\u2019s Theorem and Goldberg\u2019s Conjecture","author":"Stiebitz","key":"10.1016\/j.dam.2020.03.044_b32"},{"key":"10.1016\/j.dam.2020.03.044_b33","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph (in Russian)","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz."},{"key":"10.1016\/j.dam.2020.03.044_b34","first-page":"9","article-title":"Critical graphs with a given chromatic class (in Russian)","volume":"5","author":"Vizing","year":"1965","journal-title":"Diskret. Analiz."},{"key":"10.1016\/j.dam.2020.03.044_b35","series-title":"Proc. 37th Congress of the Brazilian Computer Society (CSBC \u201917\/II ETC), S\u00e3o Paulo","first-page":"71","article-title":"Edge-colouring of triangle-free graphs with no proper majors","author":"Zatesko","year":"2017"},{"key":"10.1016\/j.dam.2020.03.044_b36","series-title":"Proc. 2nd Workshop de Pesquisa Em Computa\u00e7\u00e3o Dos Campos Gerais (WPCCG \u201917), Ponta Grossa, Brazil","first-page":"69","article-title":"On a conjecture on edge-colouring join graphs","author":"Zatesko","year":"2017"},{"key":"10.1016\/j.dam.2020.03.044_b37","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.dam.2016.10.022","article-title":"On the chromatic index of join graphs and triangle-free graphs with large maximum degree","volume":"245","author":"Zorzi","year":"2018","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20301438?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20301438?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:05:19Z","timestamp":1759061119000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X20301438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":37,"alternative-id":["S0166218X20301438"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2020.03.044","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Edge-colouring graphs with bounded local degree sums","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2020.03.044","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}