**Originator(s):** ????

**Question:**
Let *G _{m}* be the graph with vertex set {1,2,...,2

**Comments/Partial results:**
It is easy to build a Hamiltonian cycle when *2m+1* and *2m+3* are
both prime, but it is not even known if *G _{m}* is Hamiltonian for
infinitely many

**References:**
This question was discussed in a thread on the now-defunct mailing list COMB-L.

Posted 7/11/03