3 citations · 10 across the 6 of their papers we have counts for
1 paper · 1 filter
Barbora Candráková, Robert Lukoťka
We prove that every simple bridgeless cubic graph with n >= 8 vertices has a travelling salesman tour of length at most 1.3n - 2, which can be constructed in polynomial time.