Recognizing tough graphs is NP-hard (Q918697): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61248964, #quickstatements; #temporary_batch_1704755592590 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:15, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing tough graphs is NP-hard |
scientific article |
Statements
Recognizing tough graphs is NP-hard (English)
0 references
1990
0 references
tough graphs
0 references
