Recognizing tough graphs is NP-hard (Q918697)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4160130
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing tough graphs is NP-hard |
scientific article; zbMATH DE number 4160130 |
Statements
Recognizing tough graphs is NP-hard (English)
0 references
1990
0 references
tough graphs
0 references
0.95340884
0 references
0.9238191
0 references
0.90609443
0 references
0 references
0.8899978
0 references
0.88836145
0 references
0.87918353
0 references
0 references
0 references
