{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T19:11:12Z","timestamp":1757704272358},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s00373-010-0890-4","type":"journal-article","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T10:26:37Z","timestamp":1265711197000},"page":"807-816","source":"Crossref","is-referenced-by-count":5,"title":["Smallest Set-Transversals of k-Partitions"],"prefix":"10.1007","volume":"25","author":[{"given":"Csilla","family":"Bujt\u00e1s","sequence":"first","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,10]]},"reference":[{"key":"890_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/jgt.3190160405","volume":"16","author":"J.L. Arocha","year":"1992","unstructured":"Arocha J.L., Bracho J., Neumann-Lara V.: On the minimum size of tight hypergraphs. J. Graph Theory 16, 319\u2013326 (1992)","journal-title":"J. Graph Theory"},{"key":"890_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/jgt.20197","volume":"54","author":"J.L. Arocha","year":"2007","unstructured":"Arocha J.L., Tey J.: The size of minimum 3-trees. J. Graph Theory 54, 103\u2013114 (2007)","journal-title":"J. Graph Theory"},{"key":"890_CR3","volume-title":"Hypergraphs","author":"C. Berge","year":"1989","unstructured":"Berge C.: Hypergraphs. North-Holland, Amsterdam (1989)"},{"key":"890_CR4","unstructured":"Bujt\u00e1s, Cs., Tuza, Zs.: Partition-crossing hypergraphs. Results presented at the international conferences on graph theory and combinatorics in Bled (Slovenia) and Reading, Great Britain (2007)"},{"key":"890_CR5","unstructured":"Diao, K., Liu, G.: Bounds on minimum C-edge number of 4-uniform C-hypergraphs. Manuscript temporarily posted on the internet in early 2006\u00a0at http:\/\/www.paper.edu.cn (2006)"},{"key":"890_CR6","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.disc.2005.12.020","volume":"306","author":"K. Diao","year":"2006","unstructured":"Diao K., Liu G., Rautenbach D., Zhao P.: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. Discrete Math. 306, 670\u2013672 (2006)","journal-title":"Discrete Math."},{"key":"890_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(99)00382-9","volume":"220","author":"K. Diao","year":"2000","unstructured":"Diao K., Zhao P., Zhou H.: About the upper chromatic number of a C-hypergraph. Discrete Math. 220, 67\u201373 (2000)","journal-title":"Discrete Math."},{"key":"890_CR8","unstructured":"Lov\u00e1sz, L.: Topological and algebraic methods in graph theory. In: Bondy, A.J., Murty, U.S.R. (eds.) Graph Theory and Related Topics. Proceeding Conference in Honour of W.T. Tutte, Waterloo, 1977, pp. 1\u201314. Academic Press, Dublin (1979)"},{"key":"890_CR9","doi-asserted-by":"crossref","unstructured":"Parekh, O.: Forestation in hypergraphs: linear k-trees. Elect. J. Combin. 10(N12):6 (2003)","DOI":"10.37236\/1752"},{"key":"890_CR10","unstructured":"Sterboul, F.: A new combinatorial parameter. In: Hajnal, A. et\u00a0al. (eds.) Infinite and Finite Sets. Colloq. Math. Soc. J. Bolyai, 10, vol. 3, Keszthely (1973). (North-Holland\/American Elsevier, 1975) pp. 1387\u20131404"},{"key":"890_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(75)90106-5","volume":"11","author":"F. Sterboul","year":"1975","unstructured":"Sterboul F.: Un probl\u00e8me extr\u00e9mal pour les graphes et les hypergraphes. Discrete Math. 11, 71\u201378 (1975)","journal-title":"Discrete Math."},{"key":"890_CR12","unstructured":"Sterboul, F.: A problem in constructive combinatorics and related questions. In: Hajnal, A., S\u00f3s, T. (eds.) Combinatorics. Colloq. Math. Soc. J. Bolyai, 18, vol. 2, Keszthely 1976, pp. 1049\u20131064. North-Holland, Amsterdam (1978)"},{"key":"890_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0167-5060(08)70029-3","volume":"9","author":"F. Sterboul","year":"1980","unstructured":"Sterboul F.: Un probl\u00e8me de coloration aux aspects vari\u00e9s. Ann. Discrete Math. 9, 29\u201333 (1980)","journal-title":"Ann. Discrete Math."},{"key":"890_CR14","first-page":"25","volume":"11","author":"V. Voloshin","year":"1995","unstructured":"Voloshin V.: On the upper chromatic number of a hypergraph. Australas. J. Combin. 11, 25\u201345 (1995)","journal-title":"Australas. J. Combin."},{"key":"890_CR15","doi-asserted-by":"crossref","unstructured":"Voloshin, V.I.: Coloring Mixed Hypergraphs: Theory, Algorithms and Applications, vol. 17. Fields Institute Monographs, AMS (2002)","DOI":"10.1090\/fim\/017"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0890-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0890-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0890-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T19:20:29Z","timestamp":1590607229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0890-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["890"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0890-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}