{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:55:19Z","timestamp":1712303719886},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,2,2]],"date-time":"2008-02-02T00:00:00Z","timestamp":1201910400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s10623-007-9166-2","type":"journal-article","created":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T16:06:08Z","timestamp":1201881968000},"page":"17-33","source":"Crossref","is-referenced-by-count":8,"title":["On the existence of nearly Kirkman triple systems with subsystems"],"prefix":"10.1007","volume":"48","author":[{"given":"Dameng","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Rees","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,2,2]]},"reference":[{"key":"9166_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1090\/pspum\/019\/9959","volume":"19","author":"D.K. Ray-Chaudhuri","year":"1971","unstructured":"Ray-Chaudhuri D.K. and Wilson R.M. (1971). Solution of Kirkman\u2019s schoolgirl problem. Amer. Math. Soc. Symp. Pure Math. 19: 187\u2013203","journal-title":"Amer. Math. Soc. Symp. Pure Math."},{"key":"9166_CR2","first-page":"289","volume":"11","author":"R.D. Baker","year":"1977","unstructured":"Baker R.D. and Wilson R.M. (1977). Nearly Kirkman triple systems. Utilitas Math. 11: 289\u2013296","journal-title":"Utilitas Math."},{"key":"9166_CR3","first-page":"311","volume":"13","author":"A.E. Brouwer","year":"1978","unstructured":"Brouwer A.E. (1978). Two new nearly Kirkman triple systems. Utilitas Math. 13: 311\u2013314","journal-title":"Utilitas Math."},{"key":"9166_CR4","unstructured":"Kotzig A., Rosa A.: Nearly Kirkman systems, Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 607\u2013614 (1974)."},{"key":"9166_CR5","first-page":"107","volume":"23","author":"R. Rees","year":"1987","unstructured":"Rees R. and Stinson D.R. (1987). On resolvable group-divisible designs with block size three. Ars Combin. 23: 107\u2013120","journal-title":"Ars Combin."},{"key":"9166_CR6","doi-asserted-by":"crossref","unstructured":"Rees R.S., Wallis W.D.: Kirkman triple systems and their generalizations: A survey. In Wallis W.D. (ed.) Designs 2002\u2013 Further Computational and Constructive Design Theory, pp. 319\u2013370. Kluwer Academic Publishers (2002).","DOI":"10.1007\/978-1-4613-0245-2_13"},{"key":"9166_CR7","first-page":"125","volume":"25","author":"R. Rees","year":"1988","unstructured":"Rees R. and Stinson D.R. (1988). Kirkman triple systems with maximum subsystems. Ars Combin. 25: 125\u2013132","journal-title":"Ars Combin."},{"key":"9166_CR8","first-page":"3","volume":"26","author":"R. Rees","year":"1988","unstructured":"Rees R. and Stinson D.R. (1988). On the existence of Kirkman triple systems containing Kirkman subsystems. Ars Combin. 26: 3\u201316","journal-title":"Ars Combin."},{"key":"9166_CR9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0012-365X(87)90060-4","volume":"65","author":"D.R. Stinson","year":"1987","unstructured":"Stinson D.R. (1987). Frames for Kirkman triple systems. Discrete Math. 65: 289\u2013300","journal-title":"Discrete Math."},{"key":"9166_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0378-3758(00)00263-9","volume":"94","author":"S. Tang","year":"2001","unstructured":"Tang S. and Shen H. (2001). Embeddings of nearly Kirkman triple systems. J. Stat. Plann. Inference 94: 327\u2013333","journal-title":"J. Stat. Plann. Inference"},{"key":"9166_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0012-365X(02)00469-7","volume":"261","author":"D. Deng","year":"2003","unstructured":"Deng D., Rees R. and Shen H. (2003). On the existence and application of nearly Kirkman triple systems with a hole of size 6 or 12. Discrete Math. 261: 209\u2013233","journal-title":"Discrete Math."},{"key":"9166_CR12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0012-365X(02)00749-5","volume":"270","author":"D. Deng","year":"2003","unstructured":"Deng D., Rees R. and Shen H. (2003). Further results on the embedding problem for nearly Kirkman triple systems. Discrete Math. 270: 99\u2013114","journal-title":"Discrete Math."},{"key":"9166_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0012-365X(03)00272-3","volume":"279","author":"G. Ge","year":"2004","unstructured":"Ge G. and Rees R. (2004). On group-divisible designs with block size four and group-type 6 u m 1. Discrete Math. 279: 247\u2013265","journal-title":"Discrete Math."},{"key":"9166_CR14","unstructured":"Deng D.: The embedding problem for nearly Kirkman triple systems, Ph.D dissertation (in Chinese), Shanghai Jiao Tong University (2002)."},{"key":"9166_CR15","volume-title":"Handbook of Combinatorial Designs","year":"1996","unstructured":"Colbourn C.J., Dinitz J.H. (eds.) (1996). Handbook of Combinatorial Designs. CRC Press, Boca Raton, Florida"},{"key":"9166_CR16","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1016588722296","volume":"26","author":"R.J.R. Abel","year":"2002","unstructured":"Abel R.J.R., Bennett F.E. and Ge G. (2002). The existence of four HMOLS with equal sized holes. Des. Codes Cryptogr. 26: 7\u201331","journal-title":"Des. Codes Cryptogr."},{"key":"9166_CR17","first-page":"299","volume":"28","author":"N.C.K. Phillips","year":"1998","unstructured":"Phillips N.C.K., Wallis W.D. and Rees R.S. (1998). Kirkman packing and covering designs. J. Comb. Math. Comb. Computing 28: 299\u2013325","journal-title":"J. Comb. Math. Comb. Computing"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9166-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9166-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9166-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:09Z","timestamp":1559245809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9166-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,2]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9166"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9166-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,2]]}}}