On vertex-transitive graphs with a unique hamiltonian cycle
Abstract
A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss some examples with infinitely many ends. In particular, we show each nonabelian free group Fn has a Cayley graph of degree 2n + 2 that has a unique hamiltonian circle. (A weaker statement had been conjectured by A. Georgakopoulos.) Furthermore, we prove that these Cayley graphs of Fn are outerplanar.
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.