{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:17:50Z","timestamp":1767914270560,"version":"3.49.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00249-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"477-488","source":"Crossref","is-referenced-by-count":30,"title":["On sum coloring of graphs"],"prefix":"10.1016","volume":"127","author":[{"given":"Mohammad R","family":"Salavatipour","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00249-4_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/inco.1997.2677","article-title":"On chromatic sums and distributed resource allocation","volume":"140","author":"Bar-Noy","year":"1998","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0166-218X(02)00249-4_BIB2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1006\/jagm.1998.0938","article-title":"The minimum color sum of bipartite graphs","volume":"28","author":"Bar-Noy","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB3","first-page":"17","article-title":"Graphs that require many colors to achieve their chromatic sum","volume":"71","author":"Erd\u00f6s","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00249-4_BIB4","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1137\/0215009","article-title":"An O(EVlogV) algorithm for finding a maximal weighted matching in general graphs","volume":"15","author":"Galil","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00249-4_BIB5","series-title":"Computers and Interactability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0012-365X(99)00319-2","article-title":"Minimal coloring and strength of graphs","volume":"215","author":"Hajiabolhassan","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00249-4_BIB7","doi-asserted-by":"crossref","unstructured":"M.M. Halld\u00f3rsson, G. Kortsarz, Multicoloring planar graphs and partial k-trees, in: Proceedings of the Second International Workshop on Approximation Algorithms, Springer, Berlin, 1999.","DOI":"10.1007\/978-3-540-48413-4_8"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB8","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\/S0166-218X(02)00249-4_BIB9","unstructured":"K. Jansen, Complexity results for the optimum cost chromatic partition problem, preprint."},{"key":"10.1016\/S0166-218X(02)00249-4_BIB10","doi-asserted-by":"crossref","unstructured":"L.G. Kroon, A. Sen, H. Deng, A. Roy, The optimum cost chromatic partition problem for trees and interval graphs, in: International Workshop on Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1197, 1996, pp. 279\u2013292.","DOI":"10.1007\/3-540-62559-3_23"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB11","unstructured":"E. Kubika, The chromatic sum of a graph, Ph.D. Thesis, Western Michigan University, 1989."},{"key":"10.1016\/S0166-218X(02)00249-4_BIB12","doi-asserted-by":"crossref","unstructured":"E. Kubika, A.J. Schwenk, An introduction to chromatic sums, in: Proceedings of the 17th Annual ACM Computer Science Conference, ACM Press, New York, 1989, pp. 39\u201345.","DOI":"10.1145\/75427.75430"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","article-title":"NP-completeness of finding the chromatic index of regular graphs","volume":"4","author":"Leven","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB14","unstructured":"M. Salavatipour, On sum coloring of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto, January 2000."},{"key":"10.1016\/S0166-218X(02)00249-4_BIB15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TCAD.1987.1270250","article-title":"Finding a maximum planar subset of nets in a channel","volume":"1","author":"Supowit","year":"1987","journal-title":"IEEE Trans. Comput. Aided Design CAD 6"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB16","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/jgt.3190130310","article-title":"Tight bounds on the chromatic sum of a connected graph","volume":"13","author":"Thomassen","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","article-title":"Computing the minimum fill-in is NP-complete","volume":"2","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB18","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","article-title":"Node-deletion problems on bipartite graphs","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00249-4_BIB19","doi-asserted-by":"crossref","unstructured":"K. Jansen, Approximation results for the optimum cost chromatic partition problem, J. Algorithms 34 (2000) 54\u201389.","DOI":"10.1006\/jagm.1999.1022"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB20","doi-asserted-by":"crossref","unstructured":"T. Jiang, D. West, Coloring of trees with minimum sum of colors, J. Graph Theory 32 (1999) 354\u2013358.","DOI":"10.1002\/(SICI)1097-0118(199912)32:4<354::AID-JGT4>3.0.CO;2-B"},{"key":"10.1016\/S0166-218X(02)00249-4_BIB21","doi-asserted-by":"crossref","unstructured":"K. Kubika, G. Kubika, D. Kountanis, Approximation algorithms for the chromatic sum, in: Proceedings of the First Great Lakes Computer Science Conference, Lecture Notes in Computer Science, Vol. 507, 1989, pp. 15\u201321.","DOI":"10.1007\/BFb0038467"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002494?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002494?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T09:38:12Z","timestamp":1580895492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02002494"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00249-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}