Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete (Q1168729): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A remark on a problem of Harary / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of problems in games, graphs and algebraic equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar Formulae and Their Uses / rank | |||
Normal rank |
Latest revision as of 15:46, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete |
scientific article |
Statements
Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete (English)
0 references
1981
0 references
planar kernel
0 references
grundy numbering
0 references
NP-completeness
0 references
planar digraph
0 references