On hamiltonian cycles in Cayley graphs of order pqrs

Simple item page
dc.contributor.authorMorris, Dave W.
dc.date.accessioned2025-12-17T22:01:52Z
dc.date.available2025-12-17T22:01:52Z
dc.date.issued2022
dc.descriptionOpen access article. Creative Commons 4.0 International license (CC BY 4.0) applies
dc.description.abstractLet 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.
dc.identifier.citationMorris, D. W. (2022). On hamiltonian cycles in Cayley graphs of order pqrs. the Art of Discrete and Applied Mathematics, 5, Article #P3.12. On hamiltonian cycles in Cayley graphs of order pqrs
dc.identifier.urihttps://hdl.handle.net/10133/7262
dc.language.isoen
dc.publisherUniversity of Primorska
dc.publisher.departmentDepartment of Mathematics and Computer Science
dc.publisher.facultyArts and Science
dc.publisher.institutionUniversity of Lethbridge
dc.publisher.urlhttps://doi.org/10.26493/2590-9770.1442.cb1
dc.subjectCayley graph
dc.subjectHamiltonian cycle
dc.titleOn hamiltonian cycles in Cayley graphs of order pqrs
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Morris-on-hamiltonian.pdf
Size:
2.22 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.75 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Morris, Dave