Finding 2-Factors Closer to TSP Tours in Cubic Graphs (Q2848544)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding 2-Factors Closer to TSP Tours in Cubic Graphs |
scientific article |
Statements
Finding 2-Factors Closer to TSP Tours in Cubic Graphs (English)
0 references
26 September 2013
0 references
bridgeless cubic graphs
0 references
minimum-weight 2-factor covering 3-edge cuts
0 references
polyhedral description of 2-factors covering 3-edge cuts
0 references
2-factor covering 3- and 4-edge cuts
0 references
minimum 2-edge-connected spanning subgraphs
0 references
