论文信息 - G-designs of order n and index λ where G has 5 vertices or less - 字舞流文

G-designs of order n and index λ where G has 5 vertices or less

In this paper we construct G-designs of order n and index>. for a number of small graphs, G, where G has 4 or 5 vertices.

Dean G. Hoffman | Kimberly S. Kirkpatrick

[1] Jean-Claude Bermond,et al. G-decomposition of Kn, where G has four vertices or less , 1977, Discret. Math..

[2] Christopher A. Rodger,et al. Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14 , 1997, Discret. Math..

[3] H. Hanani. The Existence and Construction of Balanced Incomplete Block Designs , 1961 .

[4] Richard M. Wilson,et al. Embeddings of Steiner triple systems , 1973, Discret. Math..

[5] Christopher A. Rodger,et al. The Doyen-Wilson Theorem Extended to 5-Cycles , 1994, J. Comb. Theory, Ser. A.

[6] Jean-Claude Bermond,et al. Decomposition of complete graphs into isomorphic subgraphs with five vertices , 1980 .

[7] Grigor Gasparyan,et al. Bipartite Designs , 1998, IPCO.

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

[9] Dean G. Hoffman,et al. 5-Cycle Systems with Holes , 1996, Des. Codes Cryptogr..