Article ID Journal Published Year Pages File Type
7543750 Operations Research Letters 2018 4 Pages PDF
Abstract
For a 3-edge-connected cubic graph G=(V,E), we give an algorithm to construct a connected Eulerian subgraph of 2G using at most ⌊4|V|∕3⌋ edges.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A 4/3-approximation for TSP on cubic 3-edge-connected graphs
Authors
, , ,