{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:56Z","timestamp":1772283476191,"version":"3.50.1"},"reference-count":148,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7886,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1985,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We survey known results on the existence and enumeration of many kinds of 1\u2010factorizations of the complete graph. We also mention briefly some related questions and topics, as well as applications.<\/jats:p>","DOI":"10.1002\/jgt.3190090104","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:50:47Z","timestamp":1180425047000},"page":"43-65","source":"Crossref","is-referenced-by-count":118,"title":["One\u2010factorizations of the complete graph\u2014A survey"],"prefix":"10.1002","volume":"9","author":[{"given":"Eric","family":"Mendelsohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Rosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Mathematische Unterhaltungen und Spiele","author":"Ahrens W.","year":"1901"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060408"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90136-3"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(73)80008-5"},{"key":"e_1_2_1_6_2","unstructured":"B. A.Anderson A perfectly arranged Room square. Proc. 4th S.\u2010 E. Conf. Combinatorics Graph Theory and Computing Boca Raton 1973. Congr. Numer. VIII Utilitas Math. Winnipeg (1973)141\u2013150. MR 50#6918."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0066440"},{"key":"e_1_2_1_8_2","unstructured":"B. A.Anderson Some perfect 1\u2010factorizations.Proc. 7th. S.\u2010E. Conf. Combinatorics Graph Theory and Computing Baton Rouge 1976. Congr. Numer. XVII Utilitas Math. Winnipeg (1976)79\u201391. MR 55#7840."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1976.64.17"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90126-1"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01835650"},{"key":"e_1_2_1_12_2","series-title":"Proc. 5th S.\u2010E. Conf. Combinatorics","first-page":"229","author":"Anderson B. A.","year":"1974"},{"key":"e_1_2_1_13_2","series-title":"Proc. Conf. Keszthely 1973, Colloq. Math. Soc. J. Bolyai 10","first-page":"91","volume-title":"Infinite and Finite Sets","author":"Baranyai Zs.","year":"1975"},{"key":"e_1_2_1_14_2","first-page":"10","article-title":"Extension of colourings of the edges of a complete (uniform hyper) graph","volume":"91","author":"Baranyai Zs.","year":"1977","journal-title":"Math. Centrum Dep. Pure Math. ZW."},{"key":"e_1_2_1_15_2","volume-title":"Graphs & Digraphs","author":"Behzad M.","year":"1979"},{"key":"e_1_2_1_16_2","volume-title":"Graphes et hypergraphes","author":"Berge C.","year":"1970"},{"key":"e_1_2_1_16_3","volume-title":"Graphs and Hypergraphs","year":"1973"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70494-1"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01223913"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(81)90003-0"},{"key":"e_1_2_1_20_2","series-title":"Proc. Tenth S.\u2010E. Conf. Combinatorics","first-page":"217","volume-title":"Maximal sets of deficiency three","author":"Caccetta L.","year":"1979"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-11.3.337"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01189254"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-9.3.385"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(76)90064-9"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662102"},{"key":"e_1_2_1_26_2","author":"Chetwynd A. G.","journal-title":"Regular graphs of high degree are 1\u2010factorizable"},{"key":"e_1_2_1_27_2","unstructured":"C. J.Colbourn Some NP\u2010complete problems on graph decomposition.Proc. 19th Alerton Confer. Communication Control and Computing Allerton IL (1981)741\u2013745."},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(83)90031-6"},{"key":"e_1_2_1_29_2","first-page":"191","article-title":"Combinatorial isomorphism problems involving 1\u2010factorizations","volume":"9","author":"Colbourn C. J.","year":"1980","journal-title":"Ars Combinat."},{"key":"e_1_2_1_30_2","first-page":"189","article-title":"The rainbow highways of Oz","volume":"13","author":"Colbourn C. J.","year":"1980","journal-title":"J. Recreat. Math."},{"key":"e_1_2_1_31_2","first-page":"65","article-title":"Kotzig factorizations: Existence and computational results","volume":"12","author":"Colbourn C. J.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_32_2","series-title":"Combinatorial Math. III, Proc. 3rd Austral. Conf.","first-page":"90","volume-title":"Maximal sets of one\u2010factors","author":"Cousins E.","year":"1974"},{"key":"e_1_2_1_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90068-5"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.2307\/1988591"},{"key":"e_1_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.2307\/3029540"},{"key":"e_1_2_1_36_2","doi-asserted-by":"publisher","DOI":"10.2307\/2970423"},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(81)80029-7"},{"key":"e_1_2_1_38_2","unstructured":"A.Ehrenfeucht V.Faber S.Fajtlowicz andJ.Mycielski Representations of finite lattices as partition lattices on finite sets.Proc. Univ. Houston Lattice Theory Conf. Houston1973 pp.17\u201335. MR 53#217."},{"key":"e_1_2_1_39_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190020202"},{"key":"e_1_2_1_40_2","volume-title":"Edge\u2010Colorings of Graphs","author":"Fiorini S.","year":"1977"},{"key":"e_1_2_1_41_2","doi-asserted-by":"publisher","DOI":"10.2307\/2306437"},{"key":"e_1_2_1_42_2","unstructured":"E. N.Gelling On 1\u2010factorizations of the complete graph and the relationship to round robin schedules M.Sc. Thesis University of Victoria (1973)."},{"key":"e_1_2_1_43_2","unstructured":"E. N.GellingandR. E.Odeh On 1\u2010factorizations of the complete graph and the relationship to round robin schedules.Proc. Third Manitoba Conf. Numerical Math. Winnipeg 1973.Congr. Numer. 9 Utilitas Math. Winnipeg1974)213\u2013221. MR 50#171."},{"key":"e_1_2_1_44_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1960-013-3"},{"key":"e_1_2_1_45_2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"key":"e_1_2_1_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70178-X"},{"key":"e_1_2_1_47_2","first-page":"255","article-title":"Tripling quadruple systems","volume":"10","author":"Hartman A.","year":"1980","journal-title":"Ars Combinat."},{"key":"e_1_2_1_48_2","first-page":"334","article-title":"Problem 4","volume":"36","author":"Hartman A.","year":"1981","journal-title":"Discrete Math."},{"key":"e_1_2_1_49_2","unstructured":"A.HartmanandA.Rosa Cyclic one\u2010factorizations of the complete graph.Europ. J. Combinat. in press."},{"key":"e_1_2_1_50_2","first-page":"155","article-title":"A note on one\u2010factorizations","volume":"20","author":"Hartman A.","year":"1981","journal-title":"Utilitas Math."},{"key":"e_1_2_1_51_2","doi-asserted-by":"publisher","DOI":"10.2307\/2319491"},{"key":"e_1_2_1_52_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90020-0"},{"key":"e_1_2_1_53_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060108"},{"key":"e_1_2_1_54_2","first-page":"66","article-title":"On 1\u2010factorability and edge\u2010colorability of cartesian products of graphs","volume":"29","author":"Himelwright P. E.","year":"1974","journal-title":"Elem. Math."},{"key":"e_1_2_1_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02190160"},{"key":"e_1_2_1_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90156-5"},{"key":"e_1_2_1_57_2","first-page":"169","article-title":"On partially resolvable t\u2010partitions","volume":"12","author":"Huang C.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90043-0"},{"key":"e_1_2_1_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90146-0"},{"key":"e_1_2_1_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90274-1"},{"key":"e_1_2_1_61_2","first-page":"191","article-title":"On a problem in combinations","volume":"2","author":"Kirkman T. P.","year":"1847","journal-title":"Cambridge and Dublin Math. J."},{"key":"e_1_2_1_62_2","first-page":"11","volume-title":"Theorie der endlichen und unendlichen Graphen","author":"K\u00f6nig D.","year":"1936"},{"key":"e_1_2_1_63_2","first-page":"42","article-title":"O postroenii zakrytykh sistem troek grupp par poriadka 12","volume":"2","author":"Korovina N. P.","year":"1972","journal-title":"Kombinat. Analiz"},{"key":"e_1_2_1_64_2","first-page":"43","article-title":"O nekotorykh klassakh sistem grupp par","volume":"3","author":"Korovina N. P.","year":"1974","journal-title":"Kombinat. Analiz"},{"key":"e_1_2_1_65_2","first-page":"271","article-title":"Sistemy par ciklickeskogo tipa","volume":"28","author":"Korovina N. P.","year":"1980","journal-title":"Mat. Zametki"},{"key":"e_1_2_1_66_2","first-page":"27","article-title":"Konstruktivnoye pereckislenie sistem triokh grupp par poriadka 12","volume":"4","author":"Korovina N. P.","year":"1976","journal-title":"Kombinat. Analiz"},{"key":"e_1_2_1_67_2","series-title":"Proc. Sympos. Smolenice 1963","first-page":"63","volume-title":"Theory of Graphs and its Applications","author":"Kotzig A.","year":"1964"},{"key":"e_1_2_1_68_2","series-title":"Proc. Sympos. Smolenice 1963","first-page":"62","volume-title":"Problem 20. Theory of Graphs and its Applications","author":"Kotzig A.","year":"1964"},{"key":"e_1_2_1_69_2","series-title":"Combinat. Structures Appl., Proc. Conf. Calgary 1969","first-page":"215","author":"Kotzig A.","year":"1970"},{"key":"e_1_2_1_70_2","series-title":"Proc. Ninth S.\u2010E. Conf. Combinatorics","first-page":"457","volume-title":"Problems and recent results on 1\u2010factorizations of Cartesian products of graphs","author":"Kotzig A.","year":"1978"},{"key":"e_1_2_1_71_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030104"},{"key":"e_1_2_1_72_2","first-page":"99","article-title":"Strongly Hamiltonian graphs","volume":"14","author":"Kotzig A.","year":"1978","journal-title":"Utilitas Math."},{"key":"e_1_2_1_73_2","first-page":"95","article-title":"Quelques probl\u00e8mes ouverts concernant les graphes fortement hamiltoniens","volume":"3","author":"Kotzig A.","year":"1979","journal-title":"Ann. Sci. Math. Qu\u00e9bec"},{"key":"e_1_2_1_74_2","volume-title":"Mathematical Recreations","author":"Kraitchik M.","year":"1942"},{"key":"e_1_2_1_75_2","first-page":"43","article-title":"On strongly Hamiltonian complete bipartite graphs","volume":"9","author":"Laufer P. J.","year":"1980","journal-title":"Ars Combinat."},{"key":"e_1_2_1_76_2","unstructured":"A.Lentin Sur certains ensembles constitu\u00e9s dansS(2n) par 2n\u2010 1 involutions sans point fixe et discordantes. Manuscript U.E.R. de Math. Log. Formelle et Informatique Paris (1979) 37pp."},{"key":"e_1_2_1_77_2","unstructured":"A.Lentin Variations surK(2n). Manuscript 10pp."},{"key":"e_1_2_1_78_2","first-page":"222","article-title":"Problem 24","volume":"41","author":"Lindner C. C.","year":"1982","journal-title":"Discrete Math."},{"key":"e_1_2_1_79_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(76)90017-4"},{"key":"e_1_2_1_80_2","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(75)90167-2"},{"key":"e_1_2_1_81_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(76)90044-3"},{"key":"e_1_2_1_82_2","first-page":"61","article-title":"There are at least 31,021 nonisomorphic Steiner quadruple systems of order 16","volume":"10","author":"Lindner C. C.","year":"1976","journal-title":"Utilitas Math."},{"key":"e_1_2_1_83_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90122-X"},{"key":"e_1_2_1_84_2","first-page":"203","article-title":"A note on one\u2010factorizations having a prescribed number of edges in common","volume":"12","author":"Lindner C. C.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_85_2","unstructured":"T.Lobbos Sur les coloriages des ar\u011btes des graphes complets. Ph.D. Thesis Universit\u00e9 de Montr\u00e9al (1978)."},{"key":"e_1_2_1_86_2","first-page":"211","article-title":"Syst\u00e8mes de transition et coloriages euleriens","volume":"12","author":"Lobbos T.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_87_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(83)90052-3"},{"key":"e_1_2_1_88_2","first-page":"161","volume-title":"R\u00e9cr\u00e9ations math\u00e9matiques","author":"Lucas E.","year":"1883"},{"key":"e_1_2_1_89_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1981-017-9"},{"key":"e_1_2_1_90_2","first-page":"129","article-title":"A census of 1\u2010factorizations of K: Solutions with group of order > 4","volume":"16","author":"Mathon R.","year":"1983","journal-title":"Ars Combinat."},{"key":"e_1_2_1_91_2","series-title":"Proc. Tenth S.\u2010E. Conf. Combinatorics","first-page":"739","volume-title":"On some properties of 1\u2010factorizations of complete graphs","author":"Mendelsohn E.","year":"1979"},{"issue":"47","key":"e_1_2_1_92_2","first-page":"157","article-title":"Edge\u2010coloring of a family of regular graphs","volume":"33","author":"Mohar B.","year":"1983","journal-title":"Publ. Inst. Math., Nouv. S\u00e9r."},{"key":"e_1_2_1_93_2","article-title":"Edge\u2010coloring of composite regular graphs","volume":"19","author":"Mohar B.","year":"1981","journal-title":"Preprint Series Dept. Math. Univ. Ljubljana"},{"key":"e_1_2_1_94_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01295483"},{"key":"e_1_2_1_95_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01339081"},{"key":"e_1_2_1_96_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1969-063-6"},{"key":"e_1_2_1_97_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01834113"},{"key":"e_1_2_1_98_2","unstructured":"U. S. R.Murty Baranyai's theorem. Manuscript."},{"key":"e_1_2_1_99_2","first-page":"17","article-title":"Konstruktivnoe pereckislenie sistem grupp par i oglavlennye sistemy troek Skteinera","volume":"2","author":"Neporozknev I. P.","year":"1972","journal-title":"Kombinat. Analiz"},{"key":"e_1_2_1_100_2","first-page":"28","article-title":"Konstruktivnoe pereckislenie sistem grupp par i oglavlennye sistemy troek Skteinera (prodolzkenie)","volume":"3","author":"Neporozknev I. P.","year":"1974","journal-title":"Kombinat. Analiz"},{"key":"e_1_2_1_101_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90036-0"},{"key":"e_1_2_1_102_2","doi-asserted-by":"publisher","DOI":"10.2307\/2039454"},{"key":"e_1_2_1_103_2","unstructured":"R.Peltesohn Des Turnierproblem f\u00fcr Spiele zu je dreien. Dissertation Berlin August Pries Leipzig (1936)."},{"key":"e_1_2_1_104_2","first-page":"93","article-title":"O neizomorfnykh oglavlennykh sistemakh troek Steinera i sistemakh grupp par","volume":"4","author":"Petrenyuk A. Y.","year":"1971","journal-title":"Kibernetika"},{"key":"e_1_2_1_105_2","unstructured":"A. Y.PetrenyukandV. Y.Sniter On the construction of a graph ofH\u2010transformations of 1\u2010factorizations of order 10 (Russian).Akad. Nauk Ukrain. SSR Inst. Mat.Preprint 1981 No. 1. \u00f8\u2010Preobrazovaniya i Kombinator. Svoistva Grafov 34\u201348 55. MR 83c:05101."},{"key":"e_1_2_1_106_2","first-page":"6","article-title":"O pereckislenii soverskennykh 1\u2010faktorizaciik polnykh grafov","volume":"1","author":"Petrenyuk L. P.","year":"1980","journal-title":"Kibernetika"},{"key":"e_1_2_1_106_3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01099353"},{"key":"e_1_2_1_107_2","unstructured":"L. P.PetrenyukandA. Y.Petrenyuk Pereckislenie soverskennykh 1\u2010faktorizaciik kubickeskikh i polnykh grafov poriadka 14.Kirovogr. Inst. Maskinostr.Kirovograd (1982)34pp."},{"key":"e_1_2_1_108_2","first-page":"311","article-title":"On the number of commutative latin squares","volume":"10","author":"Phelps K. T.","year":"1980","journal-title":"Ars Combinat."},{"key":"e_1_2_1_109_2","first-page":"193","article-title":"1\u2010factorization of the composition of regular graphs","volume":"33","author":"Pisanski T.","year":"1982","journal-title":"Publ. Inst. Math."},{"key":"e_1_2_1_110_2","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1859.56.326"},{"key":"e_1_2_1_111_2","first-page":"73","article-title":"Constructing an annual round\u2010robin tournament played on neutral grounds","volume":"10","author":"Robinson D. F.","year":"1981","journal-title":"Math. Chronicle"},{"key":"e_1_2_1_112_2","series-title":"Combinatorial Math. VI, Proc. Conf. Armidale 1978. Lecture Notes in Mathematics 748","first-page":"127","volume-title":"Isomorphic factorizations VI: Automorphisms","author":"Robinson R. W.","year":"1979"},{"key":"e_1_2_1_113_2","doi-asserted-by":"publisher","DOI":"10.2307\/3608578"},{"key":"e_1_2_1_114_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(75)90041-2"},{"key":"e_1_2_1_115_2","unstructured":"A.Rosa Algebraic properties of designs and recursive constructions.Proc. Conf. Algebr. Aspects Combinatorics Toronto 1975. Congr. Numer. XIII Utilitas Math. Winnipeg (1975)183\u2013200. MR 56#8391."},{"key":"e_1_2_1_116_2","unstructured":"A.Rosa On generalized Room squares.Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes Orsay 1976 Colloq. Intern.C.N.R.S. No. 260 Paris (1978)353\u2013358. MR 81h:05028."},{"key":"e_1_2_1_117_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb32825.x"},{"key":"e_1_2_1_118_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70848-3"},{"key":"e_1_2_1_119_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(82)90051-8"},{"key":"e_1_2_1_120_2","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/67.1.127"},{"key":"e_1_2_1_121_2","first-page":"32","article-title":"Rectangular arrays of combinations","volume":"47","author":"Rutt N. E.","year":"1941","journal-title":"Bull. Amer. Math. Soc."},{"key":"e_1_2_1_122_2","first-page":"303","article-title":"The existence of balanced tournament designs","volume":"3","author":"Schellenberg P. J.","year":"1977","journal-title":"Ars Combinat."},{"key":"e_1_2_1_123_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120907"},{"key":"e_1_2_1_124_2","unstructured":"J. A. M.Schreuder Timetables for sport (soccer) competitions.Combinatorial Optimization III Univ. of Stirling (October1982) pp.181\u2013194."},{"key":"e_1_2_1_125_2","first-page":"109","article-title":"Steiner triple systems with given subspaces; another proof of the Doyen\u2010Wilson\u2010theorem","volume":"17","author":"Stern G.","year":"1980","journal-title":"Bollet. U.M.I. (5)"},{"key":"e_1_2_1_126_2","unstructured":"R. A.Stong On 1\u2010factorizability of Cayley graphs in press."},{"key":"e_1_2_1_127_2","first-page":"193","article-title":"Scheduling designs for a league tournament","volume":"15","author":"Straley T. H.","year":"1983","journal-title":"Ars Combinat."},{"key":"e_1_2_1_128_2","volume-title":"Combinatorics: A First Course","author":"Street A. P.","year":"1982"},{"key":"e_1_2_1_129_2","first-page":"41","article-title":"Ein Prinzip f\u00fcr Schachturnier\u2010Tabellen","volume":"8","author":"Tietze H.","year":"1956","journal-title":"Archimedes"},{"key":"e_1_2_1_130_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01258856"},{"key":"e_1_2_1_131_2","first-page":"22","article-title":"K voprosu o konstruktivnom pereckislenii sistem grupp uporiadockennykh par","volume":"4","author":"Turkevick E. I.","year":"1976","journal-title":"Kombinat. Analiz"},{"key":"e_1_2_1_132_2","first-page":"38","article-title":"Ob odnom algoritme pereckislenia sistem grupp par","volume":"2","author":"Voznyak V. V.","year":"1972","journal-title":"Kombinat. Analiz"},{"key":"e_1_2_1_133_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700014178"},{"key":"e_1_2_1_134_2","series-title":"Combinatorial Math. VIII, Proc. 8th Austral. Conf., Geelong 1980. Lecture Notes in Mathematics 884","first-page":"337","volume-title":"One\u2010factorizations of wreath products","author":"Wallis W. D.","year":"1981"},{"key":"e_1_2_1_135_2","first-page":"21","article-title":"A one\u2010factorization of a Cartesian product","volume":"20","author":"Wallis W. D.","year":"1981","journal-title":"Utilitas Math."},{"key":"e_1_2_1_136_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0334270000002927"},{"key":"e_1_2_1_137_2","first-page":"149","article-title":"The problem of the hospitable golfers","volume":"15","author":"Wallis W. D.","year":"1983","journal-title":"Ars Combinat."},{"key":"e_1_2_1_138_2","series-title":"Lecture Notes in Mathematics 292","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0069907","volume-title":"Combinatorics: Room Squares, Sum\u2010Free Sets, Hadamard Matrices","author":"Wallis W. D.","year":"1972"},{"key":"e_1_2_1_139_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(80)90028-1"},{"key":"e_1_2_1_140_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73478-9"},{"key":"e_1_2_1_141_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(82)90042-7"},{"key":"e_1_2_1_142_2","unstructured":"D.de Werra Graphs and sports scheduling. Operations Research and Sports (Ed. S. Ladany) in press."},{"key":"e_1_2_1_143_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0070415"},{"key":"e_1_2_1_144_2","volume-title":"Introduction to Graph Theory","author":"Wilson R. J.","year":"1972"},{"key":"e_1_2_1_145_2","first-page":"72","article-title":"Fast\u2010Blockpl\u00e4ne","volume":"102","author":"Wolff K. E.","year":"1973","journal-title":"Mitt. Math. Sem. Giessen"},{"key":"e_1_2_1_146_2","first-page":"185","article-title":"On the size of partial 1\u2010factors of 1\u2010factorizations of the complete k\u2010uniform hypergraph on kn vertices","volume":"6","author":"Woolbright D. E.","year":"1978","journal-title":"Ars Combinat."},{"key":"e_1_2_1_147_2","first-page":"333","article-title":"Quasigroups and factorisation of complete digraphs","volume":"23","author":"Zelinka B.","year":"1973","journal-title":"Mat. Casopis"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190090104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:46:08Z","timestamp":1697867168000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190090104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":148,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["10.1002\/jgt.3190090104"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190090104","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}