{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:56Z","timestamp":1759637756818},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411833"},{"type":"electronic","value":"9783540400646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40064-8_26","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:42Z","timestamp":1186892742000},"page":"279-289","source":"Crossref","is-referenced-by-count":8,"title":["Coloring Mixed Hypertrees"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[]},{"given":"Heinz-J\u00fcrgen","family":"Voss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"26_CR1","first-page":"76","volume":"4","author":"R. Ahlswede","year":"1979","unstructured":"R. Ahlswede, Coloring hypergraphs: a new approach to multi-user source coding, I and II, Journal of Combinatorics, Information, and System Sciences\n                        4 (1979), 76\u2013115, and 5 (1980), 220\u2013268.","journal-title":"Journal of Combinatorics, Information, and System Sciences"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/S0166-218X(97)89209-8","volume":"77","author":"E. Bulgaru","year":"1997","unstructured":"E. Bulgaru and V. Voloshin, Mixed interval hypergraphs, Discrete Applied Math.\n                        77 (1997), 24\u201341.","journal-title":"Discrete Applied Math."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0404018","volume":"4","author":"T. Etzion","year":"1991","unstructured":"T. Etzion and A. Hartman, Towards a large set of Steiner quadruple systems, SIAM J. Discrete Math.\n                        4 (1991), 182\u2013195.","journal-title":"SIAM J. Discrete Math."},{"key":"26_CR4","unstructured":"T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin, D. B. West, The chromatic spectrum of mixed hypergraphs, submitted"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF02351589","volume":"8","author":"H. Lefmann","year":"1992","unstructured":"H. Lefmann, V. R\u00f6dl, and R. Thomas, Monochromatic vs. multicolored paths, Graphs Combin.\n                        8 (1992), 323\u2013332.","journal-title":"Graphs Combin."},{"key":"26_CR6","first-page":"179","volume":"L","author":"L. Milazzo","year":"1995","unstructured":"L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le Matematiche\n                        L (Catania, 1995), 179\u2013193.","journal-title":"Le Matematiche"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0012-365X(97)80332-9","volume":"174","author":"L. Milazzo","year":"1997","unstructured":"L. Milazzo and Zs. Tuza, Upper chromatic number of Steiner triple and quadruple systems, Discrete Math.\n                        174 (1997), 247\u2013259.","journal-title":"Discrete Math."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0012-365X(97)00143-X","volume":"182","author":"L. Milazzo","year":"1998","unstructured":"L. Milazzo and Zs. Tuza, Strict colorings for classes of Steiner triple systems, Discrete Math.\n                        182 (1998), 233\u2013243.","journal-title":"Discrete Math."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Zs. Tuza and V. Voloshin, Uncolorable mixed hypergraphs, Discrete Applied Math., (to appear).","DOI":"10.1016\/S0166-218X(99)00134-1"},{"key":"26_CR10","first-page":"25","volume":"11","author":"V. Voloshin","year":"1995","unstructured":"V. Voloshin, On the upper chromatic number of a hypergraph, Australasian J. Comb.\n                        11 (1995), 25\u201345.","journal-title":"Australasian J. Comb."},{"key":"26_CR11","unstructured":"V.6Voloshin, Mixed hypergraphs as models for real problems, (in preparation)."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40064-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T18:56:19Z","timestamp":1550775379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40064-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411833","9783540400646"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-40064-8_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}