{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:39:25Z","timestamp":1648935565192},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T00:00:00Z","timestamp":1351123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10878-012-9559-7","type":"journal-article","created":{"date-parts":[[2012,10,24]],"date-time":"2012-10-24T20:22:28Z","timestamp":1351110148000},"page":"737-751","source":"Crossref","is-referenced-by-count":1,"title":["Colorability of mixed hypergraphs and their chromatic inversions"],"prefix":"10.1007","volume":"25","author":[{"given":"M\u00e1t\u00e9","family":"Hegyh\u00e1ti","sequence":"first","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,25]]},"reference":[{"key":"9559_CR1","unstructured":"Bacs\u00f3 G, Bujt\u00e1s Cs, Tuza Zs, Voloshin VI (2008) New challenges in the theory of hypergraph coloring. In: Acharya BD et al (eds) Advances in discrete mathematics and applications. Ramanujan Mathematical Society Lecture Notes Series, vol 13, Mysore, pp 45\u201357 (2010)"},{"key":"9559_CR2","unstructured":"Bujt\u00e1s Cs (2008) Algorithms and structure: set partitions under local constraints. PhD Thesis, Information Science& Technology PhD School, University of Pannonia, Hungary"},{"key":"9559_CR3","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2298\/AADM0701036B","volume":"1","author":"Cs Bujt\u00e1s","year":"2007","unstructured":"Bujt\u00e1s Cs, Tuza Zs (2007) Color-bounded hypergraphs, III: model comparison. Appl Anal Discr Math 1:36\u201355","journal-title":"Appl Anal Discr Math"},{"key":"9559_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s003730200023","volume":"18","author":"T Jiang","year":"2002","unstructured":"Jiang T, Mubayi D, Voloshin V, West DB (2002) The chromatic spectrum of mixed hypergraphs. Graphs Combin 18:309\u2013318","journal-title":"Graphs Combin"},{"key":"9559_CR5","first-page":"3","volume":"8","author":"L Lov\u00e1sz","year":"1973","unstructured":"Lov\u00e1sz L (1973) Coverings and colorings of hypergraphs. Congr Numer 8:3\u201312","journal-title":"Congr Numer"},{"key":"9559_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02579160","volume":"4","author":"KT Phelps","year":"1984","unstructured":"Phelps KT, R\u00f6dl V (1984) On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems. Combinatorica 4:79\u201388","journal-title":"Combinatorica"},{"key":"9559_CR7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0166-218X(99)00134-1","volume":"99","author":"Zs Tuza","year":"2000","unstructured":"Tuza Zs, Voloshin VI (2000) Uncolorable mixed hypergraphs. Discr Appl Math 99:209\u2013227","journal-title":"Discr Appl Math"},{"key":"9559_CR8","first-page":"45","volume":"1","author":"VI Voloshin","year":"1993","unstructured":"Voloshin VI (1993) The mixed hypergraphs. Comput Sci J Moldova 1:45\u201352","journal-title":"Comput Sci J Moldova"},{"key":"9559_CR9","first-page":"25","volume":"11","author":"VI Voloshin","year":"1995","unstructured":"Voloshin VI (1995) On the upper chromatic number of a hypergraph. Australas J Combin 11:25\u201345","journal-title":"Australas J Combin"},{"key":"9559_CR10","unstructured":"Voloshin VI (2006) Mixed hypergraph coloring web site http:\/\/spectrum.troy.edu\/~voloshin\/mh.html"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9559-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9559-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9559-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:19Z","timestamp":1559276599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9559-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,25]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9559"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9559-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,25]]}}}