{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T11:45:01Z","timestamp":1695642301206},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,12]],"date-time":"2012-04-12T00:00:00Z","timestamp":1334188800000},"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-1164-0","type":"journal-article","created":{"date-parts":[[2012,4,11]],"date-time":"2012-04-11T01:12:06Z","timestamp":1334106726000},"page":"747-755","source":"Crossref","is-referenced-by-count":4,"title":["Embedding an Edge-colored K(a (p); \u03bb, \u03bc) into a Hamiltonian Decomposition of K(a (p+r); \u03bb, \u03bc)"],"prefix":"10.1007","volume":"29","author":[{"given":"M.","family":"Amin Bahmanian","sequence":"first","affiliation":[]},{"given":"C. A.","family":"Rodger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,12]]},"reference":[{"key":"1164_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":"J. Combin. Theory Ser. B"},{"issue":"2","key":"1164_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(80)90030-8","volume":"31","author":"L.D. Andersen","year":"1980","unstructured":"Andersen L.D., Hilton A.J.W.: Generalized Latin rectangles I: construction and decomposition. Discrete Math. 31(2), 125\u2013152 (1980)","journal-title":"Discrete Math."},{"issue":"3","key":"1164_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(80)90136-3","volume":"31","author":"L.D. Andersen","year":"1980","unstructured":"Andersen L.D., Hilton A.J.W.: Generalized Latin rectangles II: embedding. Discrete Math. 31(3), 235\u2013260 (1980)","journal-title":"Discrete Math."},{"key":"1164_CR4","first-page":"7","volume":"307","author":"L.D. Andersen","year":"2003","unstructured":"Andersen L.D., Rodger C.A.: Decompositions of complete graphs: embedding partial edge-colourings and the method of amalgamations. Surveys in Combinatorics Lond Math Soc Lect Note Ser 307, 7\u201341 (2003)","journal-title":"Surveys in Combinatorics Lond Math Soc Lect Note Ser"},{"key":"1164_CR5","doi-asserted-by":"crossref","unstructured":"Bahmanian, M.A., Rodger, C.A.: Multiply balanced edge colorings of multigraphs. J. Graph Theory. doi: 10.1002\/jgt.20617","DOI":"10.1002\/jgt.20617"},{"key":"1164_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1080\/01621459.1952.10501161","volume":"47","author":"R.C. Bose","year":"1952","unstructured":"Bose R.C., Shimamoto T.: Classification and analysis of partially balanced incomplete block designs with two associate classes. J. Am. Statist. Assoc. 47, 151\u2013184 (1952)","journal-title":"J. Am. Statist. Assoc."},{"key":"1164_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jcta.1998.2868","volume":"83","author":"H.L. Fu","year":"1998","unstructured":"Fu H.L., Rodger C.A.: Group divisible designs with two associate classes: n\u00a0=\u00a02 or m\u00a0=\u00a02. J. Comb. Theory Ser. A 83, 94\u2013117 (1998)","journal-title":"J. Comb. Theory Ser. A"},{"key":"1164_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1017\/S0963548301004734","volume":"10","author":"H.L. Fu","year":"2001","unstructured":"Fu H.L., Rodger C.A.: 4-cycle group-divisible designs with two associate classes. Comb. Probab. Comput. 10, 317\u2013343 (2001)","journal-title":"Comb. Probab. Comput."},{"key":"1164_CR9","first-page":"33","volume":"54","author":"H.L. Fu","year":"2000","unstructured":"Fu H.L., Rodger C.A., Sarvate D.G.: The existence of group divisible designs with first and second associates, having block size 3. Ars Comb. 54, 33\u201350 (2000)","journal-title":"Ars Comb."},{"key":"1164_CR10","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9904-1945-08361-X","volume":"51","author":"M. Hall","year":"1945","unstructured":"Hall M.: An existence theorem for Latin squares. Bull. Am. Math. Soc. 51, 387\u2013388 (1945)","journal-title":"Bull. Am. Math. Soc."},{"key":"1164_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(84)90020-0","volume":"36","author":"A.J.W. Hilton","year":"1984","unstructured":"Hilton A.J.W.: Hamiltonian decompositions of complete graphs. J. Comb. Theory B 36, 125\u2013134 (1984)","journal-title":"J. Comb. Theory B"},{"key":"1164_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0095-8956(03)00030-3","volume":"88","author":"A.J.W. Hilton","year":"2003","unstructured":"Hilton A.J.W., Johnson M., Rodger C.A., Wantland E.B.: Amalgamations of connected k-factorizations. J. Comb. Theory B 88, 267\u2013279 (2003)","journal-title":"J. Comb. Theory B"},{"key":"1164_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0012-365X(86)90186-X","volume":"58","author":"A.J.W. Hilton","year":"1986","unstructured":"Hilton A.J.W., Rodger C.A.: Hamiltonian decompositions of complete regular s-partite graphs. Discrete Math. 58, 63\u201378 (1986)","journal-title":"Discrete Math."},{"key":"1164_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0012-365X(76)90039-X","volume":"14","author":"R. Laskar","year":"1976","unstructured":"Laskar R., Auerbach B.: On decomposition of r-partite graphs into edge-disjoint Hamilton circuits. Discrete Math. 14, 265\u2013268 (1976)","journal-title":"Discrete Math."},{"key":"1164_CR15","first-page":"81","volume":"5","author":"C.C. Lindner","year":"1992","unstructured":"Lindner C.C., Rodger C.A.: Generalized embedding theorems for partial Latin squares. Bull. Inst. Comb. Appl. 5, 81\u201399 (1992)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"1164_CR16","volume-title":"R\u00e9cr\u00e9ations Math\u00e9matiques. vol. 2","author":"E. Lucas","year":"1883","unstructured":"Lucas E.: R\u00e9cr\u00e9ations Math\u00e9matiques. vol. 2. Gauthiers Villars, Paris (1883)"},{"key":"1164_CR17","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0095-8956(87)90008-6","volume":"43","author":"C.St.J.A. Nash-Williams","year":"1987","unstructured":"Nash-Williams C.St.J.A.: Amalgamations of almost regular edge-colourings of simple graphs. J. Comb. Theory B 43, 322\u2013342 (1987)","journal-title":"J. Comb. Theory B"},{"key":"1164_CR18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/jgt.3190190205","volume":"19","author":"C.A. Rodger","year":"1995","unstructured":"Rodger C.A., Wantland E.B.: Embedding edge-colorings into 2-edge-connected k-factorizations of K kn+1. J. Graph Theory 19, 169\u2013185 (1995)","journal-title":"J. Graph Theory"},{"key":"1164_CR19","unstructured":"S\u0306ajna, M.: Cycle decompositions of K n and K n \u2212I. PhD Thesis Simon Fraser University (1999)"},{"key":"1164_CR20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/jcd.1027","volume":"10","author":"M. S\u0306ajna","year":"2002","unstructured":"S\u0306ajna M.: Cycle decompositions III: complete graphs and fixed length cycles. J. Comb. Des. 10, 27\u201378 (2002)","journal-title":"J. Comb. Des."},{"key":"1164_CR21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0012-365X(81)80025-8","volume":"36","author":"M. Tarsi","year":"1981","unstructured":"Tarsi M.: On the decomposition of a graph into stars. Discrete Math. 36, 299\u2013304 (1981)","journal-title":"Discrete Math."},{"key":"1164_CR22","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/0097-3165(83)90040-7","volume":"34","author":"M. Tarsi","year":"1983","unstructured":"Tarsi M.: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs. J.Comb. Theory Ser. A 34, 60\u201370 (1983)","journal-title":"J.Comb. Theory Ser. A"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1164-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1164-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1164-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:14:56Z","timestamp":1561594496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1164-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1164"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1164-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,12]]}}}