{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:40:16Z","timestamp":1649137216847},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T00:00:00Z","timestamp":1466467200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00373-016-1720-0","type":"journal-article","created":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T08:23:17Z","timestamp":1466497397000},"page":"2515-2524","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Total Colorings of Graphs with Minimum Sum of Colors"],"prefix":"10.1007","volume":"32","author":[{"given":"Ewa M.","family":"Kubicka","sequence":"first","affiliation":[]},{"given":"Grzegorz M.","family":"Kubicki","sequence":"additional","affiliation":[]},{"given":"Maxfield","family":"Leidner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,21]]},"reference":[{"key":"1720_CR1","unstructured":"Behzad, M.: Graphs and their chromatic numbers, Ph.D. Thesis, Michigan State University, 69 pages (1965)"},{"key":"1720_CR2","first-page":"17","volume":"71","author":"P Erd\u0151s","year":"1990","unstructured":"Erd\u0151s, P., Kubicka, E., Schwenk, A.: Graphs that require many colors to achieve their chromatic sum. Congr. Numer. 71, 17\u201328 (1990)","journal-title":"Congr. Numer."},{"key":"1720_CR3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1002\/(SICI)1097-0118(199912)32:4<354::AID-JGT4>3.0.CO;2-B","volume":"32","author":"T Jiang","year":"1999","unstructured":"Jiang, T., West, D.B.: Coloring of trees with minimum sum of colors. J. Gr. Theory 32, 354\u2013358 (1999)","journal-title":"J. Gr. Theory"},{"key":"1720_CR4","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1155\/S0161171204306216","volume":"30","author":"E Kubicka","year":"2004","unstructured":"Kubicka, E.: The chromatic sums of graphs; history and recent developments. Int. J. Math. Sci. 30, 1563\u20131573 (2004)","journal-title":"Int. J. Math. Sci."},{"key":"1720_CR5","first-page":"17","volume":"71","author":"E Kubicka","year":"1990","unstructured":"Kubicka, E., Schwenk, A.: Introduction to chromatic sums. Congr. Numer. 71, 17\u201328 (1990)","journal-title":"Congr. Numer."},{"key":"1720_CR6","unstructured":"Kubicka, E.: The chromatic sum and efficient tree algorithms, Ph.D. Thesis, Western Michigan University, 149 pages (1989)"},{"key":"1720_CR7","unstructured":"Leidner, M.: The study of the total coloring of graphs, Ph.D. Thesis, University of Louisville, 101 pages (2012)"},{"key":"1720_CR8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.7151\/dmgt.1050","volume":"2","author":"J Mitchem","year":"1997","unstructured":"Mitchem, J., Morris, P., Schmeichel, E.: On the cost chromatic number of outerplanar, planar, and line graphs. Discuss. Math. Graph Theory 2, 229\u2013241 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1720_CR9","first-page":"29","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a $$p$$ p -graph. Diskret. Analiz No. 3, 29\u201339 (1964)","journal-title":"Diskret. Analiz No."},{"key":"1720_CR10","first-page":"25","volume":"3","author":"VG Vizing","year":"1965","unstructured":"Vizing, V.G.: The chromatic class of a multigraph. Kibernetika (Kiev) 3, 25\u201330 (1965)","journal-title":"Kibernetika (Kiev)"},{"key":"1720_CR11","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38, 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1720-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1720-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1720-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T12:47:31Z","timestamp":1498308451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1720-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,21]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1720"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1720-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,21]]}}}