Determining the thickness of graphs is NP-hard (Q3969882): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56689316, #quickstatements; #temporary_batch_1703701571791 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56689316 / rank | |||
Normal rank | |||
Revision as of 20:35, 27 December 2023
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
