{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:30Z","timestamp":1759626630664,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(02)00408-5","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T14:20:13Z","timestamp":1046442013000},"page":"263-278","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs"],"prefix":"10.1016","volume":"295","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":"78","reference":[{"key":"10.1016\/S0304-3975(02)00408-5_BIB1","series-title":"Proc. WADS\u201995","first-page":"449","article-title":"On approximation properties of the independent set problem for degree 3 graphs","volume":"Vol. 955","author":"Berman","year":"1995"},{"key":"10.1016\/S0304-3975(02)00408-5_BIB2","doi-asserted-by":"crossref","unstructured":"C. Colbourn, J. Dinitz, A. Rosa, Bicoloring Triple Systems, Electronic J. Combin. 25(6#1), 16.","DOI":"10.37236\/1457"},{"key":"10.1016\/S0304-3975(02)00408-5_BIB3","unstructured":"Ch.J. Colbourn, A. Rosa, Triple Systems, sect. 18.6, Strict colouring and the upper chromatic number, Clarendon Press, Oxford, 1999, pp. 340\u2013341."},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S0304-3975(02)00408-5_BIB4"},{"key":"10.1016\/S0304-3975(02)00408-5_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0,1 vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards B"},{"key":"10.1016\/S0304-3975(02)00408-5_BIB6","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\/S0304-3975(02)00408-5_BIB7","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 Comb."},{"key":"10.1016\/S0304-3975(02)00408-5_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","article-title":"Maximum bounded 3-dimensional matching is MAX SNP-complete","volume":"37","author":"Kann","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00408-5_BIB9","doi-asserted-by":"crossref","unstructured":"D. Kr\u00e1l\u2019, On complexity of colouring mixed hypertrees, in: Proc. FCT\u201901, 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\/S0304-3975(02)00408-5_BIB10","doi-asserted-by":"crossref","unstructured":"D. Kr\u00e1l\u2019, J. Kratochv\u0131́l, A. Proskurowski, H.-J. Voss, Coloring mixed hypertrees, in: Proc. 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\/S0304-3975(02)00408-5_BIB11","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\/S0304-3975(02)00408-5_BIB12","unstructured":"L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L, Catania, 1995, pp. 179\u2013193."},{"key":"10.1016\/S0304-3975(02)00408-5_BIB13","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\/S0304-3975(02)00408-5_BIB14","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."},{"key":"10.1016\/S0304-3975(02)00408-5_BIB15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"On the efficiency of a good but not linear set merging algorithm","volume":"22:2","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00408-5_BIB16","first-page":"45","article-title":"The mixed hypergraphs","volume":"1","author":"Voloshin","year":"1993","journal-title":"Comput. Sci. J. Moldova"},{"key":"10.1016\/S0304-3975(02)00408-5_BIB17","first-page":"25","article-title":"On the upper chromatic number of a hypergraph","volume":"11","author":"Voloshin","year":"1995","journal-title":"Austral. J. Combin."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:27Z","timestamp":1759625547000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397502004085"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00408-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(02)00408-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}