The traveling salesman problem for cubic graphs
Computers And Intractability A Guide To The Theory Of Np Completeness