A recursive construction of asymmetric 1-factorizations

DOI10.1007/BF01835650zbMath0373.05059WikidataQ114233918 ScholiaQ114233918MaRDI QIDQ1244251

K. Appert

Publication date: 1977

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136651

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

On Nonisomorphic Room Squares, Cryptosystems involving one-factorizations of graphs, Symmetry groups of some perfect 1-factorizations of complete graphs, Symmetry groups of some perfect 1-factorizations of complete graphs, Howell designs of type \(H(p-1, p+1)\)

Cites Work

• Unnamed Item
• Unnamed Item
• On the existence of automorphism free Steiner triple systems
• Equivalence of Room designs. II
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Finite topologies and Hamiltonian paths
• On one-factorizations of complete graphs
• Symmetry groups of some perfect 1-factorizations of complete graphs