The complexity of \(L(p, q)\)-edge-labelling (Q6090539): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:05, 10 July 2024
scientific article; zbMATH DE number 7767695
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of \(L(p, q)\)-edge-labelling |
scientific article; zbMATH DE number 7767695 |
Statements
The complexity of \(L(p, q)\)-edge-labelling (English)
0 references
17 November 2023
0 references
\(L(p, q)\)-labeling
0 references
colouring
0 references
dichotomy
0 references
computational complexity
0 references
NP-hard
0 references
