3 citations · 6 across the 5 of their papers we have counts for
1 paper · 1 filter
Maciej Liskiewicz, Martin R. Schuster
We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i.e. graphs with maximum vertex degree three, and prove that the problem for an n-vertex graph…