Computation of lucky number of planar graphs is NP-hard (Q413250)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6030943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of lucky number of planar graphs is NP-hard |
scientific article; zbMATH DE number 6030943 |
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
0.8317646384239197
0 references
0.7731325030326843
0 references
0.7681283354759216
0 references
0.762343168258667
0 references
0.737971842288971
0 references
