On the number of 1-factorizations of the complete graph

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

Eric Mendelsohn, Alexander Rosa, 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

05C30: Enumeration in graph theory

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C99: Graph theory

Related Items

There are 526,915,620 nonisomorphic one‐factorizations of K₁₂, Graph factors and factorization: 1985--2003: a survey, Premature sets of 1-factors or how not to schedule round robin tournaments, Construction of Steiner quadruple systems having a prescribed number of blocks in common, On a class of completable partial edge-colourings, Steiner quadruple systems all of whose derived Steiner triple systems are nonisomorphic, Steiner quadruple systems - a survey, Subdesigns in Steiner quadruple systems, On Nonisomorphic Room Squares, On Disjoint Partial Quadruple Systems having Seventeen Blocks, On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups, Coloring Steiner Triple Systems

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