2 code implementations • 1 May 2018 • Dave Witte Morris, Kirsten Wilk
We provide a computer-assisted proof that if G is any finite group of order kp, where k < 48 and p is prime, then every connected Cayley graph on G is hamiltonian (unless kp = 2).
Combinatorics 05C25, 05C45
