Determining the thickness of graphs is NP-hard (Q3969882): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s030500410006028x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047095042 / rank | |||
Normal rank | |||
Latest revision as of 08:26, 30 July 2024
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
