Determining the thickness of graphs is NP-hard (Q3969882)
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 3793424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determining the thickness of graphs is NP-hard |
scientific article; zbMATH DE number 3793424 |
Statements
Determining the thickness of graphs is NP-hard (English)
0 references
1983
0 references
nonplanarity
0 references
printed circuits
0 references
