Algorithmic complexity of proper labeling problems (Q391137): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244033 / rank
 
Normal rank
Property / zbMATH Keywords
 
proper labeling
Property / zbMATH Keywords: proper labeling / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
multiplicative vertex-coloring weightings
Property / zbMATH Keywords: multiplicative vertex-coloring weightings / rank
 
Normal rank
Property / zbMATH Keywords
 
gap vertex-distinguishing edge colorings
Property / zbMATH Keywords: gap vertex-distinguishing edge colorings / rank
 
Normal rank
Property / zbMATH Keywords
 
fictional coloring
Property / zbMATH Keywords: fictional coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex-labeling by maximum
Property / zbMATH Keywords: vertex-labeling by maximum / rank
 
Normal rank
Property / zbMATH Keywords
 
1-2-3-conjecture
Property / zbMATH Keywords: 1-2-3-conjecture / rank
 
Normal rank
Property / zbMATH Keywords
 
multiplicative 1-2-3-conjecture
Property / zbMATH Keywords: multiplicative 1-2-3-conjecture / rank
 
Normal rank

Revision as of 15:07, 29 June 2023

scientific article
Language Label Description Also known as
English
Algorithmic complexity of proper labeling problems
scientific article

    Statements

    Algorithmic complexity of proper labeling problems (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    proper labeling
    0 references
    computational complexity
    0 references
    multiplicative vertex-coloring weightings
    0 references
    gap vertex-distinguishing edge colorings
    0 references
    fictional coloring
    0 references
    vertex-labeling by maximum
    0 references
    1-2-3-conjecture
    0 references
    multiplicative 1-2-3-conjecture
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references