New families of atomic Latin squares and perfect 1-factorisations

Abstract

A perfect 1 -factorisation of a graph G is a decomposition of G into edge disjoint 1 -factors such that the union of any two of the factors is a Hamiltonian cycle. Let p ≥ 11 be prime. We demonstrate the existence of two non-isomorphic perfect 1-factori Show more