{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:26:20Z","timestamp":1743135980646,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_44","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"532-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Complexity of Tree Multicolorings"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"issue":"2","key":"44_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1006\/jagm.2000.1106","volume":"37","author":"A. Bar-Noy","year":"2000","unstructured":"Amotz Bar-Noy, Magn\u00fas M. Halld\u00f3rsson, Guy Kortsarz, Ravit Salman, and Hadas Shachnai. Sum multicoloring of graphs. J. Algorithms, 37(2):422\u2013450, 2000.","journal-title":"J. Algorithms"},{"issue":"2","key":"44_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/jagm.1998.0938","volume":"28","author":"A. Bar-Noy","year":"1998","unstructured":"Amotz Bar-Noy and Guy Kortsarz. Minimum color sum of bipartite graphs. J. Algorithms, 28(2):339\u2013365, 1998.","journal-title":"J. Algorithms"},{"key":"44_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-48413-4_8","volume-title":"Randomization, approximation, and combinatorial optimization (Berkeley, CA, 1999)","author":"M. M. Halld\u00f3rsson","year":"1999","unstructured":"Magn\u00fas M. Halld\u00f3rsson and Guy Kortsarz. Multicoloring planar graphs and partial k-trees. In Randomization, approximation, and combinatorial optimization (Berkeley, CA, 1999), pages 73\u201384. Springer, Berlin, 1999."},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-48686-0_27","volume-title":"Computing and combinatorics (Tokyo, 1999)","author":"M. M. Halld\u00f3rsson","year":"1999","unstructured":"Magn\u00fas M. Halld\u00f3rsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, and Jan Arne Telle. Multi-coloring trees. In Computing and combinatorics (Tokyo, 1999), pages 271\u2013280. Springer, Berlin, 1999."},{"issue":"1","key":"44_CR5","first-page":"1","volume":"62","author":"M. Hujter","year":"1993","unstructured":"M. Hujter and Zs. Tuza. Precoloring extension. II. Graph classes related to bipartite graphs. Acta Mathematica Universitatis Comenianae, 62(1):1\u201311, 1993.","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-62592-5_58","volume-title":"Algorithms and complexity (Rome, 1997)","author":"K. Jansen","year":"1997","unstructured":"Klaus Jansen. The optimum cost chromatic partition problem. In Algorithms and complexity (Rome, 1997), pages 25\u201336. Springer, Berlin, 1997."},{"issue":"2","key":"44_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K. Jansen","year":"1997","unstructured":"Klaus Jansen and Petra Scheffler. Generalized coloring for tree-like graphs. Discrete Appl. Math., 75(2):135\u2013155, 1997.","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"44_CR8","first-page":"139","volume":"62","author":"J. Kratochv\u00edl","year":"1993","unstructured":"J. Kratochv\u00edl. Precoloring extension with fixed color bound. Acta Mathematica Universitatis Comenianae, 62(2):139\u2013153, 1993.","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"44_CR9","unstructured":"Ewa Kubicka. The Chromatic Sum of a Graph. PhD thesis, Western Michigan University, 1989."},{"key":"44_CR10","first-page":"15","volume-title":"Computing in the 90\u2019s (Kalamazoo, MI, 1989)","author":"E. Kubicka","year":"1991","unstructured":"Ewa Kubicka, Grzegorz Kubicki, and Dionisios Kountanis. Approximation algorithms for the chromatic sum. In Computing in the 90\u2019s (Kalamazoo, MI, 1989), pages 15\u201321. Springer, Berlin, 1991."},{"key":"44_CR11","first-page":"15","volume-title":"Proceedings of the ACM Computer Science Conf.","author":"E. Kubicka","year":"1989","unstructured":"Ewa Kubicka and Allan J. Schwenk. An introduction to chromatic sums. In Proceedings of the ACM Computer Science Conf., pages 15\u201321. Springer, Berlin, 1989."},{"issue":"2","key":"44_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/PL00009252","volume":"23","author":"S. Nicoloso","year":"1999","unstructured":"S. Nicoloso, M. Sarrafzadeh, and X. Song. On the sum coloring problem on interval graphs. Algorithmica, 23(2):109\u2013126, 1999.","journal-title":"Algorithmica"},{"issue":"1","key":"44_CR13","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/S0097539796303123","volume":"29","author":"T. Szkaliczki","year":"1999","unstructured":"Tibor Szkaliczki. Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete. SIAM J. Comput., 29(1):274\u2013287, 1999.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"44_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7151\/dmgt.1049","volume":"17","author":"Z. Tuza","year":"1997","unstructured":"Zsolt Tuza. Graph colorings with local constraints\u2014a survey. Discuss. Math. Graph Theory, 17(2):161\u2013228, 1997.","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T20:42:16Z","timestamp":1674852136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_44","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}