Symmetry groups of some perfect 1-factorizations of complete graphs

DOI10.1016/0012-365X(77)90126-1zbMath0428.05032WikidataQ114215648 ScholiaQ114215648MaRDI QIDQ5904292

B. A. Anderson

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Frobenius groupssymmetry groups1-factorizationhamiltonian circuit

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45) Symmetric groups (20B30)

Related Items (4)

Coloring Steiner Triple Systems ⋮ There are 3155 nonisomorphic perfect one‐factorizations of K₁₆ ⋮ On perfect one-factorization of the complete graph \(K_{2p}\) ⋮ A recursive construction of asymmetric 1-factorizations

Cites Work

• On the existence of automorphism free Steiner triple systems
• A recursive construction of asymmetric 1-factorizations
• Parallel concepts in graph theory
• Equivalence of Room designs. II
• Finite topologies and Hamiltonian paths
• Duplication of Room squares
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Symmetry groups of some perfect 1-factorizations of complete graphs