Computation of lucky number of planar graphs is NP-hard (Q413250): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000213858 / rank | |||
Normal rank | |||
Revision as of 19:10, 19 March 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
