Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:04, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem |
scientific article |
Statements
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (English)
0 references
1983
0 references
perfect matching
0 references
2-matching
0 references
Hamiltonian cycle
0 references
hypomatchable
0 references
