Crossing number is hard for cubic graphs (Q2496198): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3034816 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Crossing Number is NP-Complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The crossing number ofCm �Cn is as conjectured forn ?m(m + 1) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing crossing numbers in quadratic time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5587734 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4770978 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The crossing number ofC5 �Cn / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Drawing / rank | |||
Normal rank |
Revision as of 17:02, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Crossing number is hard for cubic graphs |
scientific article |
Statements
Crossing number is hard for cubic graphs (English)
0 references
12 July 2006
0 references
NP-completeness
0 references