Computation of lucky number of planar graphs is NP-hard (Q413250): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: H. S. Yoon / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C78 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6030943 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
lucky labeling | |||
| Property / zbMATH Keywords: lucky labeling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph coloring | |||
| Property / zbMATH Keywords: graph coloring / rank | |||
Normal rank | |||
Revision as of 20:02, 29 June 2023
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
