{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T06:20:10Z","timestamp":1697869210637},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0012-365x(81)90003-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"241-260","source":"Crossref","is-referenced-by-count":4,"title":["On the edge-colouring problem for unions of complete uniform hypergraphs"],"prefix":"10.1016","volume":"34","author":[{"given":"A.E.","family":"Brouwer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Tijdeman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90003-0_BIB1","first-page":"91","article-title":"On the factorization of the complete uniform hypergraph","volume":"Vol. 1","author":"Baranyai","year":"1975"},{"key":"10.1016\/0012-365X(81)90003-0_BIB2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0167-5060(08)70727-1","article-title":"Coloring the edges of a hypergraph and linear programming techniques","volume":"1","author":"Berge","year":"1977","journal-title":"Annals of Discrete Math."},{"key":"10.1016\/0012-365X(81)90003-0_BIB3","article-title":"Uniform hypergraphs","volume":"106","author":"Brouwer","year":"1979"},{"key":"10.1016\/0012-365X(81)90003-0_BIB4","article-title":"Parallelisms of complete designs","volume":"23","author":"Cameron","year":"1976","journal-title":"London Math. Soc. Lecture Notes"},{"key":"10.1016\/0012-365X(81)90003-0_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0167-5060(08)70331-5","article-title":"On the edge-coloring property for the closure of the complete hypergraphs","volume":"2","author":"Johnson","year":"1978","journal-title":"Annals of Discrete Math."},{"key":"10.1016\/0012-365X(81)90003-0_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0167-5060(08)70330-3","article-title":"An inequality on binomial coefficients","volume":"2","author":"Johnson","year":"1978","journal-title":"Annals of Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81900030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81900030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:26:06Z","timestamp":1555154766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81900030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81900030"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90003-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}