On the number of 1-factorizations of the complete graph

DOI10.1016/0095-8956(76)90017-4zbMath0293.05156OpenAlexW2059891919MaRDI QIDQ1212021

Alexander Rosa, Eric Mendelsohn, Charles C. Lindner

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90017-4

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)

Related Items

Coloring Steiner Triple Systems ⋮ On Nonisomorphic Room Squares ⋮ On Disjoint Partial Quadruple Systems having Seventeen Blocks ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ One-factorisations of complete graphs arising from ovals in finite planes ⋮ Switching in one-factorisations of complete graphs ⋮ Classification of Steiner quadruple systems of order 16 and rank 14 ⋮ Construction of Steiner quadruple systems having a prescribed number of blocks in common ⋮ On a class of completable partial edge-colourings ⋮ Cryptosystems involving one-factorizations of graphs ⋮ Steiner quadruple systems all of whose derived Steiner triple systems are nonisomorphic ⋮ Subdesigns in Steiner quadruple systems ⋮ Steiner quadruple systems - a survey ⋮ One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders ⋮ On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups ⋮ Premature sets of 1-factors or how not to schedule round robin tournaments ⋮ There are 526,915,620 nonisomorphic one‐factorizations of K₁₂

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of automorphism free Steiner triple systems
• On embedding incomplete symmetric Latin squares
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Finite topologies and Hamiltonian paths
• Embeddings of Steiner triple systems
• Nonisomorphic Steiner triple systems
• Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
• On one-factorizations of complete graphs