{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:27Z","timestamp":1725490227503},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_42","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"474-485","source":"Crossref","is-referenced-by-count":2,"title":["Complexity Note on Mixed Hypergraphs"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Heinz-J\u00fcrgen","family":"Voss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"42_CR1","unstructured":"C. Berge: Graphs and Hypergraphs, North Holland, 1973."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"C. Colbourn, J. Dinitz, A. Rosa: Bicoloring Triple Systems, Electronic J. Combin. 6# 1, paper 25, 16 pages.","DOI":"10.37236\/1457"},{"key":"42_CR3","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1093\/oso\/9780198535768.001.0001","volume-title":"Triple Systems","author":"Ch. J. Colbourn","year":"1999","unstructured":"Ch. J. Colbourn, A. Rosa: Triple Systems, Clarendon Press, Oxford, 1999, sect. 18.6. Strict colouring and the upper chromatic number, 340\u2013341."},{"key":"42_CR4","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. 4 (1991), 182\u2013195.","journal-title":"SIAM J. Discrete Math."},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D. B. West: Chromatic spectrum is broken, 6th Twente Workshop on Graphs and Combinatorial Optimization, 26\u201328, May, 1999, H. J. Broersma, U. Faigle and J. L. Hurink (eds.), University of Twente, May, 1999, 231\u2013234.","DOI":"10.1016\/S1571-0653(05)80030-7"},{"key":"42_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proccedings 13th International Symposium on Fundamentals of Computing Theory","author":"D. Kr\u00e1l","year":"2001","unstructured":"D. Kr\u00e1l\u2019: On Complexity of Colouring Mixed Hypertrees, to appear in Proccedings 13th International Symposium on Fundamentals of Computing Theory, 1st International Workshop on Efficient Algorithms, LNCS, 2001."},{"key":"42_CR7","unstructured":"D. Kr\u00e1l\u2019: On Feasible Sets of Mixed Hypergraphs, in preparation."},{"key":"42_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-40064-8_26","volume-title":"Proceedings 26th Workshop on Graph-Theoretic Concepts in Computer Science","author":"D. Kr\u00e1l","year":"2000","unstructured":"D. Kr\u00e1l\u2019, J. Kratochv\u00edl, A. Proskurowski, H.-J. Voss: Coloring mixed hypertrees, Proceedings 26th Workshop on Graph-Theoretic Concepts in Computer Science, LNCS vol. 1928, 2000, p. 279\u2013289."},{"key":"42_CR9","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. 8 (1992), 323\u2013332.","journal-title":"Graphs Combin."},{"key":"42_CR10","unstructured":"L. Milazzo: On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L (Catania, 1995), 179\u2013193."},{"key":"42_CR11","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. 174 (1997), 247\u2013259.","journal-title":"Discrete Math."},{"key":"42_CR12","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. 182 (1998), 233\u2013243.","journal-title":"Discrete Math."},{"key":"42_CR13","first-page":"45","volume":"1","author":"V. Voloshin","year":"1993","unstructured":"V. Voloshin: The mixed hypergraphs, Computer Science Journal of Moldova 1, 1993, 45\u201352.","journal-title":"Computer Science Journal of Moldova"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T16:58:07Z","timestamp":1708189087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}