The complexity of recognizing tough cubic graphs (Q1372728)
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: The complexity of recognizing tough cubic graphs |
scientific article; zbMATH DE number 1088851
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of recognizing tough cubic graphs |
scientific article; zbMATH DE number 1088851 |
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
