Published in

Ars Mathematica Contemporanea, 1(5), p. 27-71

DOI: 10.26493/1855-3974.177.341

Links

Tools

Export citation

Search in Google Scholar

Hamiltonian cycles in Cayley graphs whose order has few prime factors

Journal article published in 2010 by Klavdija Kutnar, Dragan Marusic, Dave Witte Morris, D. W. Morris, Joy Morris, Primož Šparl, J. Morris, P. Sparl
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Question mark in circle
Preprint: policy unknown
Upload
Question mark in circle
Postprint: policy unknown
Upload
Question mark in circle
Published version: policy unknown
Upload

Abstract

We prove that if Cay(G;S) is a connected Cayley graph with n vertices, and the prime factorization of n is very small, then Cay(G;S) has a hamiltonian cycle. More precisely, if p, q, and r are distinct primes, then n can be of the form kp with k