Minimax 2-connected subgraphs and the bottleneck traveling salesman problem (Q3919743)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimax 2-connected subgraphs and the bottleneck traveling salesman problem |
scientific article |
Statements
Minimax 2-connected subgraphs and the bottleneck traveling salesman problem (English)
0 references
1979
0 references
minimax subgraph
0 references
spanning tree
0 references
Hamilton cycles
0 references
