{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:51:12Z","timestamp":1649011872490},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,7]],"date-time":"2010-08-07T00:00:00Z","timestamp":1281139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00373-010-0967-0","type":"journal-article","created":{"date-parts":[[2010,8,6]],"date-time":"2010-08-06T09:09:49Z","timestamp":1281085789000},"page":"161-170","source":"Crossref","is-referenced-by-count":1,"title":["Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles"],"prefix":"10.1007","volume":"27","author":[{"given":"Elizabeth J.","family":"Billington","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Italo J.","family":"Dejter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. G.","family":"Hoffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. C.","family":"Lindner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,7]]},"reference":[{"key":"967_CR1","unstructured":"Billington, E.J., Hoffman, D.G., Lindner, C.C., Meszka, M.: Almost resolvable minimum coverings of complete graphs with 4-cycles (to appear)"},{"key":"967_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0097-3165(92)90099-G","volume":"59","author":"C.J. Colbourn","year":"1992","unstructured":"Colbourn C.J., Hoffman D.G., Rees R.: A new class of group divisible designs with block size three. J. Combin. Theory Ser. A 59, 73\u201389 (1992)","journal-title":"J. Combin. Theory Ser. A"},{"key":"967_CR3","first-page":"173","volume":"63","author":"I.J. Dejter","year":"2007","unstructured":"Dejter I.J., Lindner C.C., Meszka M., Rodger C.A.: Almost resolvable 4-cycle systems. J. Combin. Math. Combin. Computing 63, 173\u2013182 (2007) [Corrigendum\/Addendum ibid. 66, 297\u2013298 (2008)]","journal-title":"J. Combin. Math. Combin. Computing"},{"key":"967_CR4","first-page":"264","volume-title":"Design Theory","author":"C.C. Lindner","year":"2009","unstructured":"Lindner C.C., Rodger C.A.: Design Theory, 2nd edn, pp. 264. CRC Press, Boca Raton (2009)","edition":"2"},{"key":"967_CR5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.4153\/CMB-1975-123-4","volume":"18","author":"J. Sch\u00f6nheim","year":"1975","unstructured":"Sch\u00f6nheim J., Bialostocki A.: Packing and covering the complete graph with 4-cycles. Can. Math. Bull. 18, 703\u2013708 (1975)","journal-title":"Can. Math. Bull."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0967-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0967-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0967-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:31Z","timestamp":1559055511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0967-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,7]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["967"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0967-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,7]]}}}