{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T11:25:52Z","timestamp":1771673152501,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T00:00:00Z","timestamp":1325635200000},"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,5]]},"DOI":"10.1007\/s00373-011-1127-x","type":"journal-article","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T06:33:20Z","timestamp":1325572400000},"page":"315-326","source":"Crossref","is-referenced-by-count":12,"title":["Multidecompositions of Several Graph Products"],"prefix":"10.1007","volume":"29","author":[{"given":"Atif","family":"Abueida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Daven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,4]]},"reference":[{"key":"1127_CR1","first-page":"17","volume":"53","author":"A. Abueida","year":"2008","unstructured":"Abueida A.: Multidesigns of the complete graph with a hole into the graph-pair of order 4. Bull. Inst. Combin. Appl. 53, 17\u201320 (2008)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"4","key":"1127_CR2","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s00373-003-0530-3","volume":"19","author":"A. Abueida","year":"2003","unstructured":"Abueida A., Daven M.: Multidesigns for graphs-pairs on 4 and 5 vertices. Graphs Comb. 19(4), 433\u2013447 (2003)","journal-title":"Graphs Comb."},{"key":"1127_CR3","first-page":"17","volume":"72","author":"A. Abueida","year":"2004","unstructured":"Abueida A., Daven M.: Multidecompositions of the complete graph. Ars Comb. 72, 17\u201322 (2004)","journal-title":"Ars Comb."},{"key":"1127_CR4","first-page":"125","volume":"32","author":"A. Abueida","year":"2005","unstructured":"Abueida A., Daven M., Roblee K.: Multidesigns of the \u03bb-fold comlete graph for graph-pairs of order 4 and 5. Aust. J. Comb. 32, 125\u2013136 (2005)","journal-title":"Aust. J. Comb."},{"key":"1127_CR5","first-page":"32","volume":"49","author":"A. Abueida","year":"2007","unstructured":"Abueida A., O\u2019Neil T.: Multidecomposition of \u03bb K m into small cycles and claws. Bull. Inst. Comb. Appl. 49, 32\u201340 (2007)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"1127_CR6","first-page":"403","volume":"93","author":"A. Abueida","year":"2009","unstructured":"Abueida A., Clark S., Leach D.: Multidecomposition of the complete graph into graph pairs of order 4 with various leaves. Ars Comb. 93, 403\u2013407 (2009)","journal-title":"Ars Comb."},{"key":"1127_CR7","first-page":"11","volume":"183","author":"A. Abueida","year":"2006","unstructured":"Abueida A., Hampson C.: Multipacking and multicovering of K n \u2013F with graph-pairs of order 5 where F is a Hamilton Cycle or an (almost) 1-factor. Congr. Numerantium 183, 11\u201332 (2006)","journal-title":"Congr. Numerantium"},{"key":"1127_CR8","first-page":"139","volume":"183","author":"A. Abueida","year":"2006","unstructured":"Abueida A., Daven M., Diestelkamp W., Edwards S., Parker D.: Multidesigns for graph-triples of order 6. Congr. Numerantium 183, 139\u2013160 (2006)","journal-title":"Congr. Numerantium"},{"key":"1127_CR9","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1979","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. North-Holland Publishing Company, New York (1979)"},{"key":"1127_CR10","volume-title":"Decompositions of Graphs","author":"J. Bosak","year":"1990","unstructured":"Bosak J.: Decompositions of Graphs. Kluwer Academic Publishers, Dordrecht (1990)"},{"key":"1127_CR11","first-page":"215","volume":"28","author":"D.G. Hoffman","year":"1998","unstructured":"Hoffman D.G., Pike D.: 4-Cycle Decompoisiton of the Cartesian Prodent of Two Complete Graphs. J. Comb. Math. Comb. Comput. 28, 215\u2013226 (1998)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1127_CR12","first-page":"89","volume":"52","author":"M.G. Karunambigai","year":"2008","unstructured":"Karunambigai M.G., Muthusamy A.: Cycle factorization of tensor product of complete graphs. Bull. Inst. Combin. Appl. 52, 89\u2013100 (2008)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1127_CR13","volume-title":"Design Theory","author":"C.C. Lindner","year":"1997","unstructured":"Lindner C.C., Rodger C.A.: Design Theory. CRC Press, Boca Raton (1997)"},{"issue":"3","key":"1127_CR14","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/050626363","volume":"20","author":"J. Ma","year":"2006","unstructured":"Ma J., Pu L., Shen H.: Cycle decompositions of K n, n -I. SIAM J. Discret. Math. 20(3), 603\u2013609 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"1127_CR15","first-page":"285","volume":"37","author":"R.S. Manikandan","year":"2007","unstructured":"Manikandan R.S., Paulraja P.: C 5 -decompositions of the tensor product of complete graphs. Australas J. Comb. 37, 285\u2013293 (2007)","journal-title":"Australas J. Comb."},{"issue":"4","key":"1127_CR16","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.disc.2005.08.006","volume":"306","author":"R.S. Manikandan","year":"2006","unstructured":"Manikandan R.S., Paulraja P.: C p -decompositions of some regular graphs. Discret. Math. 306(4), 429\u2013451 (2006)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1127-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1127-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1127-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:32Z","timestamp":1559041172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1127-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,4]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1127"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1127-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,4]]}}}