On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups

DOI10.2307/2008628zbMath0656.05048OpenAlexW4234212047MaRDI QIDQ3803151

E. Seah, Douglas R. Stinson

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2008628

zbMATH Keywords

automorphism groupscomplete graphsperfect one-factorizations

Mathematics Subject Classification ID

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

Related Items (3)

Steiner triple systems of order 19 with nontrivial automorphism group ⋮ Higher melonic theories ⋮ There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On strong starters in cyclic groups
• A perfect one-factorization for \(K_{36}\)
• Symmetry groups related to the construction of perfect one factorizations of \(K_{2n}\)
• Isomorphism of strong starters in cyclic groups
• On the number of 1-factorizations of the complete graph
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• One-factorizations of the complete graph—A survey
• Minimal Edge-Colourings of Complete Graphs
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• On one-factorizations of complete graphs

This page was built for publication: On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups