{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:45:15Z","timestamp":1764557115335},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,3,1]],"date-time":"1979-03-01T00:00:00Z","timestamp":289094400000},"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":12557,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1979,3]]},"DOI":"10.1016\/0097-3165(79)90067-0","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T11:09:06Z","timestamp":1096974546000},"page":"179-185","source":"Crossref","is-referenced-by-count":17,"title":["Resolvable decomposition of Kn\u2217"],"prefix":"10.1016","volume":"26","author":[{"given":"J.C","family":"Bermond","sequence":"first","affiliation":[]},{"given":"A","family":"Germa","sequence":"additional","affiliation":[]},{"given":"D","family":"Sotteau","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(79)90067-0_BIB1","series-title":"Proc. 5th British Combinatorial Conference, Aberdeen 1975","first-page":"53","article-title":"Graph decompositions and G-designs","author":"Bermond","year":"1975"},{"key":"10.1016\/0097-3165(79)90067-0_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(77)90037-1","article-title":"Group divisible designs with block size 4","volume":"20","author":"Brouwer","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(79)90067-0_BIB3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0097-3165(74)90093-4","article-title":"On resolvable balanced incomplete block designs","volume":"17","author":"Hanani","year":"1974","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"10.1016\/0097-3165(79)90067-0_BIB4","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0097-3165(73)90007-1","article-title":"Directed triple systems","volume":"14","author":"Hung","year":"1973","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"10.1016\/0097-3165(79)90067-0_BIB5","first-page":"187","article-title":"Solution of Kirkman's schoolgirl problem","volume":"Vol. 19","author":"Ray-Chaudhuri","year":"1971"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316579900670?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316579900670?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T02:29:56Z","timestamp":1549160996000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316579900670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,3]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,3]]}},"alternative-id":["0097316579900670"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(79)90067-0","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1979,3]]}}}