Hamilton-connected Cayley graphs on Hamiltonian groups (Q5946637): Difference between revisions

Denote by \(X\) a connected Cayley graph on a Hamiltonian group, which is (regular) of degree at least 3. Then \(X\) is Hamiltonian-connected when \(X\) is not bipartite, and Hamiltonian-laceable when \(X\) is bipartite. The constructions of the desired Hamiltonian cycles or paths rely on the analogous theorem (Chen and Quimpo) for abelian Cayley graphs or some new hamiltonicity results for generalized Petersen graphs.