{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:52:20Z","timestamp":1648655540594},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,25]],"date-time":"2012-04-25T00:00:00Z","timestamp":1335312000000},"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":[[2013,7]]},"DOI":"10.1007\/s00373-012-1167-x","type":"journal-article","created":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T14:41:44Z","timestamp":1335278504000},"page":"1007-1040","source":"Crossref","is-referenced-by-count":0,"title":["Nonisomorphic Maximum Packing and Minimum Covering of K v with 8-Cycles"],"prefix":"10.1007","volume":"29","author":[{"given":"Qingde","family":"Kang","sequence":"first","affiliation":[]},{"given":"Mingchao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jingjing","family":"Huo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,25]]},"reference":[{"key":"1167_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1006\/jctb.2000.1996","volume":"81","author":"B. Alspach","year":"2001","unstructured":"Alspach B., Gavlas H.: Cycle decompositions of K n and K n \u2212 I, J. Combin. Theory Ser. B 81, 77\u201399 (2001)","journal-title":"Combin. Theory Ser. B"},{"key":"1167_CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00373-004-0601-0","volume":"21","author":"E. Billington","year":"2005","unstructured":"Billington E., Fu H., Rodger C.: Packing \u03bb-fold complete multipartite graphs with 4-cycles. Graphs Combin. 21, 169\u2013185 (2005)","journal-title":"Graphs Combin."},{"key":"1167_CR3","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"1167_CR4","first-page":"101","volume":"7","author":"J. Kennedy","year":"1993","unstructured":"Kennedy J.: Maximum packings of K n with hexagons. Australas. J. Combin. 7, 101\u2013110 (1993) Corrigendum: ibid 10, 293 (1994)","journal-title":"Australas. J. Combin."},{"key":"1167_CR5","first-page":"295","volume":"16","author":"J. Kennedy","year":"1997","unstructured":"Kennedy J.: Minimum coverings of K n with hexagons. Australas. J. Combin. 16, 295\u2013303 (1997)","journal-title":"Australas. J. Combin."},{"key":"1167_CR6","volume-title":"A Note on Combinatorics","author":"Q. Kang","year":"2009","unstructured":"Kang Q.: A Note on Combinatorics. Science Press, Beijing (2009)"},{"key":"1167_CR7","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s00373-010-0879-z","volume":"25","author":"M. Li","year":"2009","unstructured":"Li M., Huo J., Gao Z.: Maximum packings and minimum coverings of K v with octagons. Graphs Combin. 25, 735\u2013752 (2009)","journal-title":"Graphs Combin."},{"key":"1167_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0095-8956(81)90093-9","volume":"30","author":"D. Sotteau","year":"1981","unstructured":"Sotteau D.: Decompositions of K m,n $${(K_{m,n}^{*})}$$ into cycles (circuits) of length 2k. J. Combin. Theory Ser. B 30, 75\u201381 (1981)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1167_CR9","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 of 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-012-1167-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1167-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1167-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T17:05:28Z","timestamp":1561655128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1167-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,25]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1167"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1167-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,25]]}}}