Computation of lucky number of planar graphs is NP-hard (Q413250): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:42, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computation of lucky number of planar graphs is NP-hard |
scientific article |
Statements
Computation of lucky number of planar graphs is NP-hard (English)
0 references
4 May 2012
0 references
lucky labeling
0 references
computational complexity
0 references
graph coloring
0 references