{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T23:28:19Z","timestamp":1676849299122},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":8508,"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":[[1990,4]]},"DOI":"10.1016\/0012-365x(90)90179-l","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"49-80","source":"Crossref","is-referenced-by-count":7,"title":["The existence of restricted resolvable designs I: (1,2)-factorizations of K2n"],"prefix":"10.1016","volume":"81","author":[{"given":"Rolf","family":"Rees","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90179-L_BIB1","first-page":"289","article-title":"Nearly Kirkman triple systems","volume":"11","author":"Baker","year":"1977","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/0012-365X(90)90179-L_BIB2","unstructured":"F. Bennett, personal communication."},{"key":"10.1016\/0012-365X(90)90179-L_BIB3","first-page":"311","article-title":"Two new nearly Kirkman triple systems","volume":"13","author":"Brouwer","year":"1978","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/0012-365X(90)90179-L_BIB4","series-title":"Combinatorial Theory","author":"Hall","year":"1967"},{"key":"10.1016\/0012-365X(90)90179-L_BIB5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0097-3165(72)90035-0","article-title":"On balanced incomplete block designs with blocks having five elements","volume":"12","author":"Hanani","year":"1972","journal-title":"J. Combinat Theory Ser. A"},{"key":"10.1016\/0012-365X(90)90179-L_BIB6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0012-365X(72)90091-X","article-title":"On resolvable designs","volume":"3","author":"Hanani","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90179-L_BIB7","first-page":"607","article-title":"Nearly Kirkman systems","author":"Kotzig","year":"1974","journal-title":"Proc. 5th SE Conf. Combinatorics,Graph Theory and Computing"},{"key":"10.1016\/0012-365X(90)90179-L_BIB8","first-page":"39","article-title":"A construction of resolvable group-divisible designs with block size 3","volume":"24","author":"Mendelsohn","year":"1987","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(90)90179-L_BIB9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/jgt.3190090104","article-title":"One-factorizations of the complete graph\u2014a survey","volume":"9","author":"Mendelsohn","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90179-L_BIB10","first-page":"73","article-title":"Perfect pair-coverings and an algorithm for certain (1, 2)-factorizations of the complete graph K2s+1","volume":"12","author":"Mullin","year":"1981","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(90)90179-L_BIB11","first-page":"207","article-title":"Clique coverings of graphs II\u2014Complements of cliques","volume":"19","author":"Pullman","year":"1981","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/0012-365X(90)90179-L_BIB12","first-page":"187","article-title":"Solution of Kirkman's schoolgirl problem","volume":"19","author":"Ray-Chaudhuri","year":"1971"},{"key":"10.1016\/0012-365X(90)90179-L_BIB13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0012-365X(86)90098-1","article-title":"Minimal clique partitions and pairwise balanced designs","volume":"61","author":"Rees","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90179-L_BIB14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0097-3165(87)90015-X","article-title":"Uniformly resolvable pairwise balanced designs with blocksizes two and three","volume":"45","author":"Rees","year":"1987","journal-title":"J. Combinat. Theory Ser. A"},{"key":"10.1016\/0012-365X(90)90179-L_BIB15","first-page":"193","article-title":"The perfect pair-covering numbers cp(Ku \u2228 Kcm), u = m + 2, m + 3, and m + 4","volume":"32","author":"Rees","year":"1987","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/0012-365X(90)90179-L_BIB16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(88)90104-5","article-title":"Frames and the gk (\u03c5) problem","volume":"71","author":"Rees","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90179-L_BIB17","first-page":"107","article-title":"On resolvable group-divisible designs with block size 3","volume":"23","author":"Rees","year":"1987","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(90)90179-L_BIB18","doi-asserted-by":"crossref","unstructured":"R. Rees and D.R. Stinson, On the number of blocks in a perfect covering of \u03c5 points, Discrete Math, in press.","DOI":"10.1016\/0012-365X(90)90222-4"},{"key":"10.1016\/0012-365X(90)90179-L_BIB19","first-page":"211","article-title":"A class of resolvable pairwise balanced designs","volume":"55","author":"Rees","year":"1986","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0012-365X(90)90179-L_BIB20","first-page":"203","article-title":"A census of values for g(k)(1, 2; \u03c5)","volume":"20","author":"Stanton","year":"1985","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(90)90179-L_BIB21","first-page":"85","article-title":"Pair-coverings with restricted largest block length","volume":"11","author":"Stanton","year":"1981","journal-title":"Ars Combinatoria"},{"issue":"5","key":"10.1016\/0012-365X(90)90179-L_BIB22","first-page":"109","article-title":"Steiner triple systems with given subspaces; another proof of the Doyen-Wilson Theorem","volume":"17A","author":"Stern","year":"1980","journal-title":"Bolletino U.M.I."},{"key":"10.1016\/0012-365X(90)90179-L_BIB23","first-page":"323","article-title":"Applications and generalizations of the variance method in combinatorial designs","volume":"22","author":"Stinson","year":"1982","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/0012-365X(90)90179-L_BIB24","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0012-365X(87)90060-4","article-title":"Frames for Kirkman triple systems","volume":"65","author":"Stinson","year":"1987","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090179L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090179L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:16Z","timestamp":1555115116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090179L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["0012365X9090179L"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90179-l","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}