On the complexity of testing a graph for n-cube (Q1146982)
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: On the complexity of testing a graph for n-cube |
scientific article; zbMATH DE number 3702104
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of testing a graph for n-cube |
scientific article; zbMATH DE number 3702104 |
Statements
On the complexity of testing a graph for n-cube (English)
0 references
1980
0 references
n-cube characterization
0 references
efficient algorithm
0 references
