{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:44Z","timestamp":1759638224288},"reference-count":30,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2695,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1016\/j.dam.2005.05.019","type":"journal-article","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T12:15:49Z","timestamp":1131538549000},"page":"660-672","source":"Crossref","is-referenced-by-count":11,"title":["Coloring mixed hypertrees"],"prefix":"10.1016","volume":"154","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":"78","reference":[{"key":"10.1016\/j.dam.2005.05.019_bib1","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.B. Le, J. Spinrad, Graph classes: a survey, SIAM Monographs Discrete Math. Appl. (1999).","DOI":"10.1137\/1.9780898719796"},{"key":"10.1016\/j.dam.2005.05.019_bib2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/S0166-218X(97)89209-8","article-title":"Mixed interval hypergraphs","volume":"77","author":"Bulgaru","year":"1997","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2005.05.019_bib3","doi-asserted-by":"crossref","first-page":"#R25","DOI":"10.37236\/1457","article-title":"Bicoloring triple systems","volume":"6","author":"Colbourn","year":"1999","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2005.05.019_bib4","series-title":"Triple Systems","author":"Colbourn","year":"1999"},{"key":"10.1016\/j.dam.2005.05.019_bib5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(99)00382-9","article-title":"About the upper chromatic number of a co-hypergraph","volume":"220","author":"Diao","year":"2000","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2005.05.019_bib6","doi-asserted-by":"crossref","first-page":"#R35","DOI":"10.37236\/1579","article-title":"On in planar mixed hypergraphs","volume":"8","author":"Dvo\u0159\u00e1k","year":"2001","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2005.05.019_bib7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0404018","article-title":"Towards a large set of Steiner quadruple systems","volume":"4","author":"Etzion","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2005.05.019_bib8","first-page":"22","article-title":"The upper chromatic number of simple co-monostars, Anale stiintifice ale Universitatii de Stat din Moldova","author":"Flocos","year":"1997","journal-title":"Seria Stiinte Reale"},{"key":"10.1016\/j.dam.2005.05.019_bib9","series-title":"Computers and Intractability, A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.dam.2005.05.019_bib10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s003730200023","article-title":"The chromatic spectrum of mixed hypergraphs","volume":"18","author":"Jiang","year":"2002","journal-title":"Graphs Combin."},{"issue":"1","key":"10.1016\/j.dam.2005.05.019_bib11","doi-asserted-by":"crossref","first-page":"#N3","DOI":"10.37236\/1588","article-title":"Gaps in the chromatic spectrum of face-constrained plane graphs","volume":"8","author":"Kobler","year":"2001","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2005.05.019_bib12","doi-asserted-by":"crossref","unstructured":"D. Kr\u00e1l\u2019, On complexity of colouring mixed hypertrees, in: Proceedings of the FTC\u201901 and WEA\u201901, Lecture Notes in Computer Science, vol. 2138, Springer, Berlin, 2001, pp. 516\u2013524.","DOI":"10.1007\/3-540-44669-9_58"},{"key":"10.1016\/j.dam.2005.05.019_bib13","doi-asserted-by":"crossref","unstructured":"D. Kr\u00e1l\u2019, On feasible sets of mixed hypergraphs, Electronic Journal of Combinatorics 11 (1) (2004) (paper #R19).","DOI":"10.37236\/1772"},{"key":"10.1016\/j.dam.2005.05.019_bib14","doi-asserted-by":"crossref","unstructured":"D. Kr\u00e1l\u2019, J. Kratochv\u00edl, A. Proskurowski, H.-J. Voss, Coloring mixed hypertrees, in: Proceedings of the WG\u201900, Lecture Notes in Computer Science, vol. 1928, Springer, Berlin, 2000, pp. 279\u2013289.","DOI":"10.1007\/3-540-40064-8_26"},{"key":"10.1016\/j.dam.2005.05.019_bib15","doi-asserted-by":"crossref","unstructured":"D. Kr\u00e1l\u2019, J. Kratochv\u00edl, H.-J. Voss, Complexity note on mixed hypergraphs, in: Proceedings of the MFCS\u201901, Lecture Notes in Computer Science, vol. 2136, Springer, Berlin, 2001, pp. 474\u2013486.","DOI":"10.1007\/3-540-44683-4_42"},{"key":"10.1016\/j.dam.2005.05.019_bib16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0304-3975(02)00408-5","article-title":"Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs","volume":"295","author":"Kr\u00e1l\u2019","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2005.05.019_bib17","doi-asserted-by":"crossref","unstructured":"J. Kratochv\u00edl, Z. Tuza, M. Voigt, New trends in the theory of graph colorings: choosability and list coloring, in: Contemporary Trends in Discrete Mathematics (from DIMACS and DIMATIA to the future), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, AMS, Providence, RI, 1999, pp. 183\u2013197.","DOI":"10.1090\/dimacs\/049\/13"},{"key":"10.1016\/j.dam.2005.05.019_bib18","doi-asserted-by":"crossref","first-page":"#R60","DOI":"10.37236\/1538","article-title":"Colouring planar mixed hypergraphs","volume":"7","author":"K\u00fcndgen","year":"2000","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2005.05.019_bib19","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF02351589","article-title":"Monochromatic vs. multicolored paths","volume":"8","author":"Lefmann","year":"1992","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2005.05.019_bib20","unstructured":"L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L (Catania, 1995) 179\u2013193."},{"key":"10.1016\/j.dam.2005.05.019_bib21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0012-365X(97)80332-9","article-title":"Upper chromatic number of Steiner triple and quadruple systems","volume":"174","author":"Milazzo","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2005.05.019_bib22","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0012-365X(97)00143-X","article-title":"Strict colorings for classes of Steiner triple systems","volume":"182","author":"Milazzo","year":"1998","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2005.05.019_bib23","doi-asserted-by":"crossref","first-page":"81","DOI":"10.7151\/dmgt.1108","article-title":"About uniquely colorable mixed hypertrees","volume":"20","author":"Niculitsa","year":"2000","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2005.05.019_bib24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0166-218X(99)00134-1","article-title":"Uncolorable mixed hypergraphs","volume":"99","author":"Tuza","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2005.05.019_bib25","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0012-365X(01)00176-5","article-title":"Uniquely colorable mixed hypergraphs","volume":"248","author":"Tuza","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2005.05.019_bib26","first-page":"45","article-title":"The mixed hypergraphs","volume":"1","author":"Voloshin","year":"1993","journal-title":"Comput. Sci. J. Moldova"},{"key":"10.1016\/j.dam.2005.05.019_bib27","first-page":"25","article-title":"On the upper chromatic number of a mixed hypergraph","volume":"11","author":"Voloshin","year":"1995","journal-title":"Australasian J. Combin."},{"key":"10.1016\/j.dam.2005.05.019_bib28","series-title":"Paul Erdos and His Mathematics: Research Communications","first-page":"267","article-title":"Upper chromatic number and C-perfect mixed hypergraphs","author":"Voloshin","year":"1999"},{"key":"10.1016\/j.dam.2005.05.019_bib29","series-title":"Coloring Mixed Hypergraphs: Theory, Algorithms and Applications","author":"Voloshin","year":"2002"},{"key":"10.1016\/j.dam.2005.05.019_bib30","unstructured":"A list of publications on Mixed Hypergraph Coloring, available at <http:\/\/math.net.md\/voloshin\/publishe.html>."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X05002775?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X05002775?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T19:12:55Z","timestamp":1586545975000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X05002775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["S0166218X05002775"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2005.05.019","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}