\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Nicole Eggemann / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Frédéric Havet / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Steven D. Noble / rank | |||
Normal rank | |||
Revision as of 19:19, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
