{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T06:22:12Z","timestamp":1693117332262},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1984,3]]},"DOI":"10.1007\/bf02579160","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:16:21Z","timestamp":1174583781000},"page":"79-88","source":"Crossref","is-referenced-by-count":16,"title":["On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems"],"prefix":"10.1007","volume":"4","author":[{"given":"Kevin T.","family":"Phelps","sequence":"first","affiliation":[]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579160_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(82)90068-3","volume":"4","author":"C. J. Colbourn","year":"1982","unstructured":"C. J. Colbourn, M. J. Colbourn, K. T. Phelps andV. R\u00f6dl, Coloring Steiner quadruple systems,Discrete Applied Math. 4 (1982), 103\u2013111.","journal-title":"Discrete Applied Math."},{"key":"BF02579160_CR2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0097-3165(74)90068-5","volume":"16","author":"A. Cruse","year":"1974","unstructured":"A. Cruse, On embedding incomplete symmetric latin squares,J. Combinatorial Theory (A) 16 (1974), 18\u201327.","journal-title":"J. Combinatorial Theory (A)"},{"key":"BF02579160_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P. Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s andA. Hajnal, On the chromatic number of graphs and set systems,Acta Math. Acad. Sci. Hungar. 17 (1966), 61\u201399.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"BF02579160_CR4","first-page":"609","volume":"10","author":"P. Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s andL. Lov\u00e1sz, Problems and results on 3-chromatic hypergraphs and related questions,Infinite and Finite Sets, Proc. Conf. Keszthely (1973),Colloq. Math. Soc. J. Bolyai 10. 609\u2013627.","journal-title":"Infinite and Finite Sets, Proc. Conf. Keszthely (), Colloq. Math. Soc. J. Bolyai"},{"key":"BF02579160_CR5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/BF01222584","volume":"22","author":"B. Ganter","year":"1971","unstructured":"B. Ganter, Endliche Vervollst\u00e4ndigung endlicher Partieller Steinersche Systeme,Arch. Math. 22 (1971), 328\u2013332.","journal-title":"Arch. Math."},{"key":"BF02579160_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0012-365X(74)90130-7","volume":"10","author":"B. Ganter","year":"1974","unstructured":"B. Ganter, Finite partial quadruple systems can be finitely embedded,Discrete Math. 10 (1974), 397\u2013400.","journal-title":"Discrete Math."},{"key":"BF02579160_CR7","doi-asserted-by":"crossref","unstructured":"M. R. Garey andD. S. Johnson, The complexity of near-optimal graph coloring,J.A.C.M. 23, 43\u201349.","DOI":"10.1145\/321921.321926"},{"key":"BF02579160_CR8","unstructured":"M. R. Garey andD. S. Johnson,Computers and Intractability\u2014A guide to NP-completeness, W. H. Freeman and Company, 1979."},{"key":"BF02579160_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson andL. Stockmeyer, Some simplified NP-complete graph problems,Theoretical Comp. Sci. 1 (1976), 237\u2013267.","journal-title":"Theoretical Comp. Sci."},{"key":"BF02579160_CR10","unstructured":"E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York."},{"key":"BF02579160_CR11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0097-3165(75)90046-1","volume":"18","author":"C. C. Lindner","year":"1975","unstructured":"C. C. Lindner, A partial Steiner triple system of ordern can be embedded in a Steiner triple system of order 6n + 3,J. Combinatorial Theory (A),18 (1975), 349\u2013351.","journal-title":"J. Combinatorial Theory (A)"},{"key":"BF02579160_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-5060(08)70180-8","volume":"7","author":"C. C. Lindner","year":"1980","unstructured":"C. C. Lindner, A survey of embedding theorems for Steiner systems, in:Topics on Steiner Systems, Ann. Discrete Math. 7 (1980), 175\u2013202.","journal-title":"Topics on Steiner Systems, Ann. Discrete Math."},{"key":"BF02579160_CR13","unstructured":"L. Lov\u00e1sz, Coverings and colorings of hypergraphs,Proc. 45 th Southeastern Conf. Combinatorics, Graph Theory, Computing (1973), 3\u201312."},{"key":"BF02579160_CR14","unstructured":"K. T. Phelps, V. R\u00f6dl anddeBrandes, Coloring Steiner triple Systems,SIAM Alg. and Discrete Methods (to appear)."},{"key":"BF02579160_CR15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0024-3795(75)90073-7","volume":"10","author":"R. Quackenbush","year":"1975","unstructured":"R. Quackenbush, Near vector spaces over GF(q) and (v, q + 1, 1)\u2014BIBDS,Linear Alg. Appl. 10 (1975), 259\u2013266.","journal-title":"Linear Alg. Appl."},{"key":"BF02579160_CR16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0097-3165(71)90030-6","volume":"10","author":"C. A. Treash","year":"1971","unstructured":"C. A. Treash, The completion of finite incomplete Steiner triple systems with applications to loop theory,J. Combinatorial Theory (A) 10 (1971), 259\u2013265.","journal-title":"J. Combinatorial Theory (A)"},{"key":"BF02579160_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0603031","volume":"3","author":"C. J. Colbourn","year":"1982","unstructured":"C. J. Colbourn, M. J. Colbourn, K. T. Phelps andV. R\u00f6dl, Coloring Block Designs is NP-complete,SIAM J. Alg. Disc. Math. 3 (1982), 305\u2013307.","journal-title":"SIAM J. Alg. Disc. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579160.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579160\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:44:58Z","timestamp":1558183498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["BF02579160"],"URL":"https:\/\/doi.org\/10.1007\/bf02579160","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}