Does a given graph contain a path that visits every vertex exactly once on the way between given start and finish vertices? (A classic NP-complete problem.)
Represent vertices and edges by oligomers.
By hybridizing, create DNA strands representing possible paths
Select those paths that meet the Hamilton-path criteria