{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:40Z","timestamp":1725569740346},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_28","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T02:48:26Z","timestamp":1289357306000},"page":"304-314","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree"],"prefix":"10.1007","author":[{"given":"Edyta","family":"Szyma\u0144ska","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-31833-0_21","volume-title":"Approximation and Online Algorithms","author":"G. Agnarsson","year":"2005","unstructured":"Agnarsson, G., Halldorss\u00f3n, M.: Strong colorings of hypergraphs. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 253\u2013266. Springer, Heidelberg (2005)"},{"key":"28_CR2","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF02579292","volume":"3","author":"P. Erd\u0151s","year":"1983","unstructured":"Erd\u0151s, P., Simonovits, M.: Supersaturated graphs and hypergraphs. Combinatorica\u00a03(2), 181\u2013192 (1983)","journal-title":"Combinatorica"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1006\/jctb.1999.1938","volume":"78","author":"D. Caen De","year":"2000","unstructured":"De Caen, D., F\u00fcredi, Z.: The maximum size of 3-uniform hypergraphs not containing a Fano plane. J. Combinatorial Theory B\u00a078, 274\u2013276 (2000)","journal-title":"J. Combinatorial Theory B"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-61310-2_26","volume-title":"Integer Programming and Combinatorial Optimization","author":"H. Chen","year":"1996","unstructured":"Chen, H., Frieze, A.: Coloring Bipartite Hypergraphs. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 345\u2013358. Springer, Heidelberg (1996)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","volume":"43","author":"K. Edwards","year":"1986","unstructured":"Edwards, K.: The complexity of colouring problems on dense graphs. Theoretical Computer Science\u00a043, 337\u2013343 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"28_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput.\u00a05(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"28_CR8","series-title":"LNCS","first-page":"626","volume-title":"ISAAC 2009","author":"M. Karpi\u0144ski","year":"2009","unstructured":"Karpi\u0144ski, M., Ruci\u0144ski, A., Szyma\u0144ska, E.: The Complexity of Perfect Matching Problems on Dense Hypergraphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 626\u2013636. Springer, Heidelberg (2009)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","first-page":"663","volume-title":"LATIN 2010","author":"M. Karpi\u0144ski","year":"2010","unstructured":"Karpi\u0144ski, M., Ruci\u0144ski, A., Szyma\u0144ska, E.: Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 663\u2013674. Springer, Heidelberg (2010)"},{"key":"28_CR10","unstructured":"Lov\u00e1sz, L.: Coverings and coloring of hypergraphs. In: Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing, (Florida Atlantic Univ., Boca Raton, Fla., 1973), p. 312 (1973)"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.endm.2009.07.077","volume":"34","author":"Yury Person","year":"2009","unstructured":"Person, Y., Schacht, M.: An expected polynomial time algorithm for coloring 2-colorable 3-graphs. In: Proceedings of EuroComb 2009. Electronic Notes In Discrete Mathematics, vol.\u00a034, pp. 465\u2013469 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00373-008-0787-7","volume":"24","author":"O. Pikhurko","year":"2008","unstructured":"Pikhurko, O.: Perfect matchings and \n                    \n                      \n                    \n                    $K_4^3$\n                  -tilings in hypergraphs of large codegree. Graphs Combin.\u00a024(4), 391\u2013404 (2008)","journal-title":"Graphs Combin."},{"issue":"1-2","key":"28_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S0963548305007042","volume":"15","author":"V. R\u00f6dl","year":"2006","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Diracs theorem for 3-uniform hypergraphs. Combin. Probab. Comput.\u00a015(1-2), 229\u2013251 (2006)","journal-title":"Combin. Probab. Comput."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/j.jcta.2008.10.002","volume":"116","author":"V. R\u00f6dl","year":"2009","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Combin. Theory, Ser. A\u00a0116, 613\u2013636 (2009)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-642-10217-2_43","volume-title":"Combinatorial Algorithms","author":"E. Szyma\u0144ska","year":"2009","unstructured":"Szyma\u0144ska, E.: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 438\u2013449. Springer, Heidelberg (2009)"}],"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\/978-3-642-16926-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T01:39:14Z","timestamp":1539308354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}