On hamiltonian cycles in Cayley graphs of order pqrs
Abstract
Let G be a finite group. We show that if |G| = pqrs, where p, q, r, and s are distinct odd primes, then every connected Cayley graph on G has a hamiltonian cycle.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.