\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: k-L(2,1)-labelling for planar graphs is NP-complete for k 4 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) |
scientific article |
Statements
\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (English)
0 references
5 November 2010
0 references
frequency assignment problem
0 references
\(L(2, 1)\)-labelling
0 references
planar graph
0 references
NP-complete
0 references
0.8564746975898743
0 references
0.8525314927101135
0 references
0.8411307334899902
0 references
0.815994918346405
0 references
0.8141158819198608
0 references
