Determining the thickness of graphs is NP-hard (Q3969882)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining the thickness of graphs is NP-hard |
scientific article |
Statements
Determining the thickness of graphs is NP-hard (English)
0 references
1983
0 references
nonplanarity
0 references
printed circuits
0 references
