Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
Let \(G\) be a group with \(e\) as its identity, and \(S\subseteq G\backslash\{e\}\) be a generating set of \(G\). The Cayley digraph \(\text{Cay}(S:G)\) is the directed graph with vertex set \(G\) and \(xy\) is an arc of the digraph if and only if there is an element \(g\in S\) such that \(xy=y\). The Cayley graph \(\text{Cay}(S:G)\) is undirected if \(g^{-1}\in S\) whenever \(g\in S\). This paper is a most comprehensive and updated survey article about the problem of Hamilton circuits and Hamilton paths in Cayley graphs since the 1984 survey paper by \textit{D. Witte} and \textit{J. A. Gallian} [Discrete Math. 51, No. 3, 293-304 (1984; Zbl 0712.05039)].
scientific article; zbMATH DE number 932548
scientific article