Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem |
scientific article; zbMATH DE number 3849266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem |
scientific article; zbMATH DE number 3849266 |
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
0.8860352
0 references
0.88559246
0 references
0.88362265
0 references
0 references
0.8810392
0 references
0.8790026
0 references
0.8753067
0 references
