论文信息 - On the number of 1-factorizations of the complete graph☆ - 字舞流文

On the number of 1-factorizations of the complete graph☆

C. Lindner | A. Rosa | E. Mendelsohn

[1] Anthony J. W. Hilton,et al. Colouring the Edges of a Multigraph so that Each Vertex has at Most j, or at Least j, Edges of Each Colour on it , 1975 .

[2] Alexander Rosa,et al. On the existence of automorphism free Steiner triple systems , 1975 .

[3] Richard M. Wilson,et al. Nonisomorphic Steiner triple systems , 1974 .

[4] J. Dénes,et al. Latin squares and their applications , 1974 .

[5] Allan B. Cruse,et al. On Embedding Incomplete Symmetric Latin Squares , 1974, J. Comb. Theory, Ser. A.

[6] W. D. Wallis,et al. On one-factorizations of complete graphs , 1973, Journal of the Australian Mathematical Society.

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

[8] B. A. Anderson. Finite topologies and Hamiltonian paths , 1973 .

[9] Eric Neil Gelling. On 1-factorizations of the complete graph and the relationship to round robin schedules , 1973 .

[10] A. Street,et al. Combinatorics: room squares, sum-free sets, Hadamard matrices , 1972 .

[11] Christine Treash. The completion of finite incomplete Steiner triple systems with applications to loop theory , 1971 .

[12] R. H. Bruck. A Survey of Binary Systems , 1971 .

[13] Frank Harary,et al. Graph Theory , 2016 .