The complexity of recognizing tough cubic graphs (Q1372728): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:07, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of recognizing tough cubic graphs |
scientific article |
Statements
The complexity of recognizing tough cubic graphs (English)
0 references
7 January 1998
0 references
cubic graphs
0 references
NP-completeness
0 references
tough graphs
0 references
