{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:17:11Z","timestamp":1763619431475},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00005-2","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"201-211","source":"Crossref","is-referenced-by-count":8,"title":["On the cost-chromatic number of graphs"],"prefix":"10.1016","volume":"171","author":[{"given":"John","family":"Mitchem","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Morriss","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00005-2_BIB1","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":"Alavi","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00005-2_BIB2","first-page":"17","article-title":"Graphs that require many colors to achieve their chromatic sum","volume":"71","author":"Erdős","year":"1990"},{"key":"10.1016\/S0012-365X(96)00005-2_BIB3","series-title":"Proc. 17th Ann. ACM Computer Sciences Conf.","first-page":"39","article-title":"An introduction to chromatic sums","author":"Kubicka","year":"1989"},{"key":"10.1016\/S0012-365X(96)00005-2_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/PL00009252","article-title":"On the sum coloring problem on interval graphs","author":"Nicoloso","year":"1994"},{"key":"10.1016\/S0012-365X(96)00005-2_BIB5","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","author":"Supowit","year":"1987","journal-title":"IEEE Trans. Computer-Aided Des. CAD-6"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000052?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000052?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:22Z","timestamp":1556130502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96000052"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00005-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}