Symmetry groups of some perfect 1-factorizations of complete graphs

DOI10.1016/0012-365X(77)90126-1MaRDI QIDQ5904292zbMATH OpenWikidataFDO

Authors B. A. Anderson

Publication date 1977

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(77)90126-1

zbMATH Keywords

1-factorizationFrobenius groupshamiltonian circuitsymmetry groups

Mathematics Subject Classification ID

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

Cites work

• A recursive construction of asymmetric 1-factorizations
• Duplication of Room squares
• Equivalence of Room designs. II
• Finite topologies and Hamiltonian paths
• scientific article; zbMATH DE number 3463690 (Why is no real title available?)
• scientific article; zbMATH DE number 3465361 (Why is no real title available?)
• scientific article; zbMATH DE number 3435513 (Why is no real title available?)
• scientific article; zbMATH DE number 3276424 (Why is no real title available?)
• scientific article; zbMATH DE number 3286093 (Why is no real title available?)
• scientific article; zbMATH DE number 3379174 (Why is no real title available?)
• On the existence of automorphism free Steiner triple systems
• Parallel concepts in graph theory

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5904292)