{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:44:39Z","timestamp":1725551079156},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003311"},{"type":"electronic","value":"9783540363798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36379-3_15","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:05Z","timestamp":1269897125000},"page":"164-175","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Pattern Coloring of Cycle Systems"],"prefix":"10.1007","author":[{"given":"Zden\u011bk","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[]},{"given":"Jan","family":"K\u00e1ra","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Kr\u00e1l'","sequence":"additional","affiliation":[]},{"given":"Ond\u0159ej","family":"Pangr\u00e1c","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"issue":"1","key":"15_CR1","first-page":"16","volume":"6#","author":"C. Colbourn","year":"1999","unstructured":"C. Colbourn, J. Dinitz, A. Rosa: Bicoloring Triple Systems, Electronic J. Combin. 6# 1, 1999, paper 25, 16 pages.","journal-title":"Electronic J. Combin"},{"key":"15_CR2","volume-title":"Computers and Intractability, A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, D. S. Johnson: Computers and Intractability, A Guide to the Theory of NP-completeness, Freeman, San Franscisco, Cal., 1979."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1520-6610(1999)7:1<1::AID-JCD1>3.0.CO;2-1","volume":"7","author":"L. Haddad","year":"1999","unstructured":"L. Haddad: On the chromatic numbers of Steiner triple systems, J. Combinat. Designs 7, 1999, 1\u201310.","journal-title":"J. Combinat. Designs"},{"issue":"2","key":"15_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s003730200023","volume":"18","author":"T. Jiang","year":"2002","unstructured":"T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D. B. West: The Chromatic Spectrum of Mixed Hypergraphs Graphs Comb. 18 2, 2002, 309\u2013318.","journal-title":"The Chromatic Spectrum of Mixed Hypergraphs Graphs Comb."},{"key":"15_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-40064-8_26","volume-title":"Coloring mixed hypertrees","author":"D. Kr\u00e1l\u2019","year":"2000","unstructured":"D. Kr\u00e1l', 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, 279\u2013289."},{"key":"15_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/3-540-44669-9_58","volume-title":"On Complexity of Colouring Mixed Hypertrees","author":"D. Kr\u00e1l'","year":"2001","unstructured":"D. Kr\u00e1l': On Complexity of Colouring Mixed Hypertrees, Proceedings 13th Symposium Fundamentals of Computation Theory, 1stWorkshop on Efficient Algorithms, LNCS vol. 2138, 2001, 516\u2013524."},{"key":"15_CR7","unstructured":"D. Kr\u00e1l', J. Kratochv\u00edl, H.-J. Voss: Mixed Hypergraphs with Bounded Degree: Edge-Colouring of Mixed Multigraphs, to appear in Theoretical Computer Science."},{"key":"15_CR8","first-page":"325","volume-title":"Contemporary Design Theory: A Collection of Surveys","author":"C. C. Lindner","year":"1992","unstructured":"C. C. Lindner, C. A. Roger: Decomposition into cycles II: Cycle Systems, Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson (eds.), John Wiley and Son, New York, 1992, 325\u2013369."},{"key":"15_CR9","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":"15_CR10","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":"15_CR11","doi-asserted-by":"crossref","first-page":"#R24","DOI":"10.37236\/1568","volume":"8","author":"G. Quattrocchi","year":"2001","unstructured":"G. Quattrocchi: Colouring 4-cycle systems with specified block colour patterns: the case of embedding P3-designs, Electronic J. Combinatorics 8, 2001, #R24.","journal-title":"Electronic J. Combinatorics"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"T. J. Schaefer: The complexity of satisfiability problems, Proc. of the Tenth Annual ACM Symposium on Theory of Computing (STOC), 1978, 216\u2013226.","DOI":"10.1145\/800133.804350"}],"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-36379-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T10:13:00Z","timestamp":1591179180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36379-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003311","9783540363798"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-36379-3_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}