Cayley graphs of order \(30p\) are Hamiltonian (Q1759403)

A well known conjecture in graph theory asserts that every finite connected Cayley graph with at least three vertices has a Hamiltonian cycle. In this paper the authors proved that for any group \(G\) with order \(30p\), where \(p\) is a prime, every connected Cayley graph on \(G\) contains a Hamiltonian cycle. Combining this result and a few earlier results in [\textit{K. Kutnar} et al., Ars Math. Contemp. 5, No.\,1, 27--71 (2012; Zbl 1247.05103)], [\textit{S. J. Curran, D. W. Morris} and \textit{J. Morris}, Ars Math. Contemp. 5, No.\,, 189--215 (2012; Zbl 1258.05047)] and [\textit{E. Ghaderpour} and \textit{D. W. Morris}, Int. J. Comb. 2011, Article ID 206930, 16 p. (2011; Zbl 1236.05102)], the following result has now been established: If \(G\) is a group with order \(kp\), where \(1 \leq k < 32\) with \(k \neq 24\) and \(p\) is a prime, then every connected Cayley graph on \(G\) has a Hamiltonian cycle.