Computation of lucky number of planar graphs is NP-hard (Q413250): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Vertex colouring edge partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lucky labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1,2 conjecture-the multiplicative version / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:18, 5 July 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
    0 references
    0 references
    4 May 2012
    0 references
    lucky labeling
    0 references
    computational complexity
    0 references
    graph coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references