Determining the thickness of graphs is NP-hard (Q3969882): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Planar Formulae and Their Uses / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3856672 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank |
Revision as of 17:50, 13 June 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