TSP Tours in Cubic Graphs: Beyond 4/3

José R. Correa, Omar Larré, José A. Soto

After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic 2-connected graph, has a H…