{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:14:23Z","timestamp":1649006063631},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"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":8417,"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,7]]},"DOI":"10.1016\/0012-365x(90)90222-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"81-93","source":"Crossref","is-referenced-by-count":4,"title":["On the number of blocks in a perfect covering of \u03c5 points"],"prefix":"10.1016","volume":"83","author":[{"given":"Rolf","family":"Rees","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90222-4_BIB1","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 Combin."},{"key":"10.1016\/0012-365X(90)90222-4_BIB2","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)90222-4_BIB3","doi-asserted-by":"crossref","unstructured":"R. Rees, The existence of restricted resolvable designs I: (1,2)-factorizations of K2n, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(90)90179-L"},{"key":"10.1016\/0012-365X(90)90222-4_BIB4","doi-asserted-by":"crossref","unstructured":"R. Rees, The existence of restricted resolvable designs II: (1,2)-factorizations of K2n + 1, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(90)90066-Q"},{"key":"10.1016\/0012-365X(90)90222-4_BIB5","first-page":"211","article-title":"A class of resolvable pairwise balanced designs","volume":"55","author":"Rees","year":"1986","journal-title":"Congressus Numer."},{"key":"10.1016\/0012-365X(90)90222-4_BIB6","first-page":"142","article-title":"Old and new results on perfect coverings","volume":"IX","author":"Stanton","year":"1981"},{"key":"10.1016\/0012-365X(90)90222-4_BIB7_1","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)90222-4_BIB7_2","first-page":"221","article-title":"Addendum","volume":"21","author":"Stanton","year":"1986","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90222-4_BIB8","first-page":"85","article-title":"Pair-coverings with restricted longest block length","volume":"11","author":"Stanton","year":"1981","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90222-4_BIB9","first-page":"269","article-title":"Computation of some exact g-coverings","volume":"18","author":"Stanton","year":"1980","journal-title":"Utilitas Math."},{"key":"10.1016\/0012-365X(90)90222-4_BIB10","first-page":"451","article-title":"the \u03bb-\u03bc problem: \u03bb = 1 and \u03bc = 3","author":"Stanton","year":"1972","journal-title":"Proc. Second Chapel Hill Conf. on Combinatorics"},{"key":"10.1016\/0012-365X(90)90222-4_BIB11","first-page":"323","article-title":"Applications and generalizations of the variance method in combinatorial designs","volume":"22","author":"Stinson","year":"1982","journal-title":"Utilitas Math."},{"key":"10.1016\/0012-365X(90)90222-4_BIB12","first-page":"505","article-title":"The \u03bb-\u03bc problem","volume":"1","author":"Woodall","year":"1968","journal-title":"J. London Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X90902224?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X90902224?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:18Z","timestamp":1555134858000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X90902224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["0012365X90902224"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90222-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}