G-designs and related designs

Abstract This is a survey on the existence of G -designs, bipartite G -designs and multipartite G -designs.

[1]  Michael Tarsi Decomposition of complete multigraphs into stars , 1979, Discret. Math..

[2]  N. Hamada,et al.  On claw-decomposition of complete graphs and complete bigraphs , 1975 .

[3]  MICHAEL TARSI Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs , 1983, J. Comb. Theory, Ser. A.

[4]  Charlotte Huang Resolvable balanced bipartite designs , 1976, Discret. Math..

[5]  Haim Hanani,et al.  Balanced incomplete block designs and related designs , 1975, Discret. Math..

[6]  Charlotte Huang On the existence of balanced bipartite designs, II , 1974, Discret. Math..

[7]  Noboru Hamada,et al.  Design of a New Balanced File Organization Scheme With the Least Redundancy , 1975, Inf. Control..

[8]  Jean-Claude Bermond,et al.  Cycles in digraphs- a survey , 1981, J. Graph Theory.

[9]  J. Bermond,et al.  Graph decompositions and G-designs , 1976 .

[10]  J. F. Lawless,et al.  On the Construction of Handcuffed Designs , 1974, J. Comb. Theory A.

[11]  Kazuhiko Ushio,et al.  Design of a generalized balanced multiple-valued file organization scheme of order two , 1978, SIGMOD '78.

[12]  Miroslaw Truszczynski Note on the decomposition of lambdaKm, n (lambdaKm, n*) into paths , 1985, Discret. Math..

[13]  D. R. Lick,et al.  The Theory and Applications of Graphs. , 1983 .

[14]  Anthony J. W. Hilton Hamiltonian decompositions of complete graphs , 1984, J. Comb. Theory, Ser. B.

[15]  Renu C. Laskar,et al.  On decomposition of r-partite graphs into edge-disjoint hamilton circuits , 1976, Discret. Math..

[16]  H. Tverberg,et al.  On the decomposition of kn into complete bipartite graphs , 1982, J. Graph Theory.

[17]  Alexander Rosa,et al.  Graph decompositions, handcuffed prisoners and balanced P-designs , 1972, Discret. Math..

[18]  Jin Akiyama,et al.  Factors and factorizations of graphs - a survey , 1985, J. Graph Theory.

[19]  田澤 新成 Claw-decomposition and evenly-partite-claw-decomposition of complete multi-partite graphs , 1979 .

[20]  Kazuhiko Ushio P3-Factorization of complete bipartite graphs , 1988, Discret. Math..

[21]  Alessandro Rosa On the cyclic decompositions of the complete graph into polygons with an odd number of edges , 1966 .

[22]  Ernest J. Cockayne,et al.  Edge partitions of complete multipartite graphs into equal length circuits , 1977, J. Comb. Theory, Ser. B.

[23]  Douglas R. Stinson,et al.  On Decomposing Graphs into Isomorphic Uniform 2-Factors , 1985 .

[24]  Decomposition of complete graphs into 6-stars and into 10-stars , 1975 .

[25]  Hikoe Enomoto,et al.  Ck-factorization of complete bipartite graphs , 1988, Graphs Comb..

[26]  Kazuhiko Ushio,et al.  Partite-claw-decomposition of a complete multipartite graph , 1978 .

[27]  Kazuhiko Ushio,et al.  On balanced claw designs of complete multi-partite graphs , 1982, Discret. Math..

[28]  Dominique Sotteau Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k , 1981, J. Comb. Theory, Ser. B.

[29]  K. Ushio,et al.  On claw-decomposition of a complete multipartite graph , 1978 .

[30]  Joseph Douglas Horton Resolvable Path Designs , 1985, J. Comb. Theory, Ser. A.

[31]  Alexander Rosa,et al.  Another class of balanced graph designs: balanced circuit designs , 1975, Discret. Math..

[32]  Pauline Cain Decomposition of complete graphs into stars , 1974, Bulletin of the Australian Mathematical Society.

[33]  Jean-Claude Bermond,et al.  Existence of Resolvable Path Designs , 1990, Eur. J. Comb..

[34]  Kazuhiko Ushio,et al.  Design of a balanced multiple-valued file-organization scheme with the least redundancy , 1979, ACM Trans. Database Syst..