There are 3155 nonisomorphic perfect one‐factorizations of K16

DOI10.1002/jcd.21683OpenAlexW2986075789MaRDI QIDQ6185551

No author found.

Publication date: 29 January 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21683

zbMATH Keywords

orderly algorithmone-factorizationperfect one-factorizationmaximal perfect setpremature perfect set

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Classification algorithms for codes and designs
• Premature sets of 1-factors or how not to schedule round robin tournaments
• A perfect one-factorization for \(K_{36}\)
• New families of atomic Latin squares and perfect 1-factorisations.
• Finite topologies and Hamiltonian paths
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• One-factorizations of the complete graph—A survey
• Intersection of perfect 1-factorizations of complete graphs
• Orderly algorithms for generating restricted classes of graphs
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• A perfect one‐factorisation of
• Perfect 1-factorizations
• Symmetry groups of some perfect 1-factorizations of complete graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: There are 3155 nonisomorphic perfect one‐factorizations of K₁₆