{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T17:42:45Z","timestamp":1773078165340,"version":"3.50.1"},"reference-count":41,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7351,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0012-365x(93)90408-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"299-311","source":"Crossref","is-referenced-by-count":30,"title":["G-designs and related designs"],"prefix":"10.1016","volume":"116","author":[{"given":"Kazuhiko","family":"Ushio","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90408-L_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190090103","article-title":"Factors and factorizations of graphs - a survey","volume":"9","author":"Akiyama","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)90408-L_BIB2","series-title":"Proc. 5th British Combinatorial Conf.","first-page":"53","article-title":"Graph decompositions and G-designs","author":"Bermond","year":"1975"},{"key":"10.1016\/0012-365X(93)90408-L_BIB3","first-page":"293","article-title":"Balanced cycle and circuit designs: even cases","volume":"5","author":"Bermond","year":"1978","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(93)90408-L_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190050102","article-title":"Cycles in digraphs - a survey","volume":"5","author":"Bermond","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)90408-L_BIB5","series-title":"Proc. 6th Inter. Conf. The Theory and Applications of Graphs","article-title":"Existence of resolvable path designs","author":"Bermond","year":"1988"},{"key":"10.1016\/0012-365X(93)90408-L_BIB6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1017\/S0004972700040582","article-title":"Decomposition of complete graphs into stars","volume":"10","author":"Cain","year":"1974","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0012-365X(93)90408-L_BIB7","series-title":"Combinatorial Mathematics 3","first-page":"136","article-title":"Decomposition of complete graphs into 6-stars and into 10-stars","volume":"452","author":"Cain","year":"1975"},{"key":"10.1016\/0012-365X(93)90408-L_BIB8","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0095-8956(77)90029-6","article-title":"Edge partitions of complete multipartite graphs into equal length circuits","volume":"23","author":"Cockayne","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90408-L_BIB9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01864159","article-title":"Ck-factorization of complete bipartite graphs","volume":"4","author":"Enomoto","year":"1988","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(93)90408-L_BIB10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(75)90040-0","article-title":"Balanced incomplete block designs and related designs","volume":"11","author":"Hanani","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(72)90005-2","article-title":"Graph decompositions, handcuffed prisoners and balanced P-designs","volume":"2","author":"Hell","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(84)90020-0","article-title":"Hamilton decompositions of complete graphs","volume":"36","author":"Hilton","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90408-L_BIB13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0097-3165(85)90033-0","article-title":"Resolvable path designs","author":"Horton","year":"1985","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)90408-L_BIB14","first-page":"297","article-title":"On decomposing graphs into isomorphic uniform 2-factors","volume":"27","author":"Horton","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB15","first-page":"55","article-title":"On the existence of balanced bipartite designs","volume":"4","author":"Huang","year":"1973","journal-title":"Utilitas Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0012-365X(74)90145-9","article-title":"On the existence of balanced bipartite designs II","volume":"9","author":"Huang","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(76)90064-9","article-title":"Resolvable balanced bipartite designs","volume":"14","author":"Huang","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(77)90003-6","article-title":"Handcuffed designs","volume":"18","author":"Hung","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB19","first-page":"229","article-title":"On the decomposition of complete graphs into 4k-gons","volume":"15","author":"Kotzig","year":"1965","journal-title":"Math. Fyz. Casop."},{"key":"10.1016\/0012-365X(93)90408-L_BIB20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0097-3165(74)90073-9","article-title":"On the construction of handcuffed designs","volume":"16","author":"Lawless","year":"1974","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)90408-L_BIB21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0012-365X(76)90039-X","article-title":"On decomposition of r-partite graphs into edge-disjoint hamilton circuits","volume":"14","author":"Laskar","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB22","first-page":"85","article-title":"Balance and designs: another terminological tangle","volume":"21C","author":"Preece","year":"1982","journal-title":"Utilitas Math"},{"key":"10.1016\/0012-365X(93)90408-L_BIB23","first-page":"349","article-title":"On the cyclic decomposition of the complete graph into (4m + 2)-gons","volume":"16","author":"Rosa","year":"1966","journal-title":"Math. Fyz. Casop."},{"key":"10.1016\/0012-365X(93)90408-L_BIB24","doi-asserted-by":"crossref","first-page":"53","DOI":"10.21136\/CPM.1966.117555","article-title":"On the cyclic decomposition of the complete graph into polygons with odd number of edges","volume":"91","author":"Rosa","year":"1966","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"10.1016\/0012-365X(93)90408-L_BIB25","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0012-365X(75)90051-5","article-title":"Another class of balanced graph designs: balanced circuit designs","volume":"12","author":"Rosa","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB26","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0095-8956(81)90093-9","article-title":"Decomposition of Km, n(K\u2217m, n) into cycles (circuits) of length 2k","volume":"30","author":"Sotteau","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90408-L_BIB27","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(79)90034-7","article-title":"Decomposition of complete multigraphs into stars","volume":"26","author":"Tarsi","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB28","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/0097-3165(83)90040-7","article-title":"Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs","volume":"34","author":"Tarsi","year":"1983","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)90408-L_BIB29","doi-asserted-by":"crossref","first-page":"195","DOI":"10.32917\/hmj\/1206135569","article-title":"Partite-claw-decomposition of a complete multi-partite graph","volume":"8","author":"Tazawa","year":"1978","journal-title":"Hiroshima Math. J."},{"key":"10.1016\/0012-365X(93)90408-L_BIB30","doi-asserted-by":"crossref","first-page":"503","DOI":"10.32917\/hmj\/1206134898","article-title":"Claw-decomposition and evenly-partite-claw-decomposition of complete multi-partite graphs","volume":"9","author":"Tazawa","year":"1979","journal-title":"Hiroshima Math. J."},{"key":"10.1016\/0012-365X(93)90408-L_BIB31","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/jgt.3190060414","article-title":"On the decomposition of Kn into complete bipartite graphs","volume":"6","author":"Tverberg","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)90408-L_BIB32","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(85)80023-6","article-title":"Note on the decomposition of \u03bbKm, n(\u03bbK\u2217m, n) into paths","volume":"55","author":"Truszczynski","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB33","doi-asserted-by":"crossref","first-page":"207","DOI":"10.32917\/hmj\/1206135570","article-title":"On claw-decomposition of a complete multi-partite graph","volume":"8","author":"Ushio","year":"1978","journal-title":"Hiroshima Math. J."},{"key":"10.1016\/0012-365X(93)90408-L_BIB34","doi-asserted-by":"crossref","first-page":"321","DOI":"10.32917\/hmj\/1206134105","article-title":"Bipartite decomposition of complete multipartite graphs","volume":"11","author":"Ushio","year":"1981","journal-title":"Hiroshima Math. J."},{"key":"10.1016\/0012-365X(93)90408-L_BIB35","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(82)90177-7","article-title":"On balanced claw designs of complete multi-partite graphs","volume":"38","author":"Ushio","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB36","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0012-365X(88)90227-0","article-title":"P3-factorization of complete bipartite graphs","volume":"72","author":"Ushio","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90408-L_BIB37","series-title":"Proc. 5th British Combinatorial Conf.","first-page":"647","article-title":"Decompositions of complete graphs into subgraphs isomorphic to a given graph","author":"Wilson","year":"1975"},{"key":"10.1016\/0012-365X(93)90408-L_BIB38","doi-asserted-by":"crossref","first-page":"33","DOI":"10.32917\/hmj\/1206136782","article-title":"On claw-decomposition of complete graphs and complete bigraphs","volume":"5","author":"Yamamoto","year":"1975","journal-title":"Hiroshima Math. J."},{"key":"10.1016\/0012-365X(93)90408-L_BIB39","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/S0019-9958(75)90267-3","article-title":"Design of a new balanced file organization scheme with the least redundancy","volume":"28","author":"Yamamoto","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/0012-365X(93)90408-L_BIB40","series-title":"Proc. ACM-SIGMOD Inter. Conf. on Management of Data","first-page":"47","article-title":"Design of a generalized balanced multiple-valued file organization scheme of order two","author":"Yamamoto","year":"1978"},{"key":"10.1016\/0012-365X(93)90408-L_BIB41","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1145\/320107.320123","article-title":"Design of a balanced multiple-valued file organization scheme with the least redundancy","volume":"4","author":"Yamamoto","year":"1979","journal-title":"ACM Trans. Database Systems"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390408L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390408L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:38:35Z","timestamp":1621031915000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390408L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":41,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0012365X9390408L"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90408-l","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}