Cayley graphs of order 8pq are hamiltonian
arXiv:2304.03348 · doi:10.55016/ojs/cdm.v20i2.77376
Abstract
We give a computer-assisted proof that if is a finite group of order , where and are distinct primes, then every connected Cayley graph on has a hamiltonian cycle.
23 pages. GAP computer programs in the ancillary files directory. v2: updated the url of the source code