Hamilton Paths in Generalized Petersen Graphs
William P. J. Pensaert · 2002
This thesis puts forward the conjecture that for n>3k with k>2, the generalized Petersen graph, GP (n, k) is Hamilton-laceable if n is even and k is odd, and it is Hamilton-connected otherwise. We take the first step in the