Barbora Candráková

most citedAvoiding 5-circuits in a 2-factor of cubic graphs

4 citations · 7 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DM2015★ 3 cited

Cubic TSP - a 1.3-approximation

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.

math.CO2013★ 4 cited

Avoiding 5-circuits in a 2-factor of cubic graphs

Barbora Candráková, Robert Lukoťka

We show that every bridgeless cubic graph $G$ on $n$ vertices other than the Petersen graph has a 2-factor with at most $2 (n - 2) /15$ circuits of length $5$ . An infinite family of gr…