This problem is a variant of UNDIRECTED HAMILTON PATH in bounded-degree graphs.
The language in question is the set of all triples (G, s, t) for which G is an undirected graph with maximum degree at most 2 containing a Hamilton path from node s to node t.