{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:06:26Z","timestamp":1648551986507},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T00:00:00Z","timestamp":1406592000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10100-014-0357-4","type":"journal-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:39:17Z","timestamp":1406554757000},"page":"867-876","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximum number of colors in hypertrees of bounded degree"],"prefix":"10.1007","volume":"23","author":[{"given":"Csilla","family":"Bujt\u00e1s","sequence":"first","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,29]]},"reference":[{"key":"357_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/jgt.3190160405","volume":"16","author":"JL Arocha","year":"1992","unstructured":"Arocha JL, Bracho J, Neumann-Lara V (1992) On the minimum size of tight hypergraphs. J Graph Theory 16:319\u2013326","journal-title":"J Graph Theory"},{"issue":"3","key":"357_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/jcd.20169","volume":"16","author":"G Bacs\u00f3","year":"2008","unstructured":"Bacs\u00f3 G, Tuza Zs (2008) Upper chromatic number of finite projective planes. J Comb Des 16(3):221\u2013230","journal-title":"J Comb Des"},{"key":"357_CR3","volume-title":"Hypergraphs","author":"C Berge","year":"1989","unstructured":"Berge C (1989) Hypergraphs. North-Holland, Amsterdam"},{"key":"357_CR4","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s Cs, Tuza Zs (2011) Maximum number of colors: C-coloring and related problems. J Geom 101:83\u201397","DOI":"10.1007\/s00022-011-0082-2"},{"key":"357_CR5","unstructured":"Bujt\u00e1s Cs, Tuza Zs (2013) Approximability of the upper chromatic number of hypergraphs, manuscript"},{"key":"357_CR6","doi-asserted-by":"crossref","unstructured":"Kr\u00e1l\u2019 D (2004) On feasible sets of mixed hypergraphs. Electron J Comb 11 , #R19, 14 pp","DOI":"10.37236\/1772"},{"key":"357_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0304-3975(02)00408-5","volume":"295","author":"D Kr\u00e1l\u2019","year":"2003","unstructured":"Kr\u00e1l\u2019 D, Kratochv\u00edl J, Voss H-J (2003) Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theoret Comput Sci 295:263\u2013278","journal-title":"Theoret Comput Sci"},{"issue":"1","key":"357_CR8","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E Sperner","year":"1928","unstructured":"Sperner E (1928) Ein Satz \u00fcber Untermengen einer endlichen Menge. Math Z 27(1):544\u2013548","journal-title":"Math Z"},{"key":"357_CR9","unstructured":"Sterboul F (1973) A new combinatorial parameter. In: Hajnal A, et al (eds) Infinite and Finite Sets, Colloq. Math. Soc. J. Bolyai 10, Vol. III, Keszthely. (North-Holland\/American Elsevier, 1975), pp 1387\u20131404"},{"key":"357_CR10","first-page":"45","volume":"1","author":"VI Voloshin","year":"1993","unstructured":"Voloshin VI (1993) The mixed hypergraphs. Comput Sci J Moldova 1:45\u201352","journal-title":"Comput Sci J Moldova"},{"key":"357_CR11","doi-asserted-by":"crossref","unstructured":"Voloshin VI (2002) Coloring mixed hypergraphs: theory, algorithms and applications, vol 17. Fields Institute Monographs, American Mathematics Society, USA","DOI":"10.1090\/fim\/017"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0357-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0357-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0357-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T17:17:01Z","timestamp":1598116621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0357-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,29]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["357"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0357-4","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,29]]}}}