Simple direct constructions for hybrid triple designs
暂无分享,去创建一个
[1] Charles J. Colbourn,et al. Every Twofold Triple System Can Be Directed , 1983, J. Comb. Theory, Ser. A.
[2] Charles J. Colbourn,et al. An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits , 1985 .
[3] J. Dénes,et al. Latin squares and their applications , 1974 .
[4] C. C. Lindner. A Survey of Embedding Theorems for Steiner Systems , 1980 .
[5] J. C. Bermond. An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits , 1974, Discret. Math..
[6] F. E. Bennett. Direct Constructions for Perfect 3-Cyclic Designs , 1982 .
[7] N. S. Mendelsohn,et al. Directed Triple Systems , 1973, J. Comb. Theory, Ser. A.
[8] Kevin T. Phelps,et al. On the Number of Mendelsohn and Transitive Triple Systems , 1984, Eur. J. Comb..
[9] Jean-Claude Bermond. Decomposition of Kn* into k-circuits and balanced G-designs , 1975 .
[10] Charles J. Colbourn,et al. Hybrid triple systems and cubic feedback sets , 1989, Graphs Comb..
[11] David B. Skillicorn,et al. All Directed BIBDs with k = 3 Exist , 1980, J. Comb. Theory, Ser. A.