Further hardness results on the rainbow vertex-connection number of graphs (Q385046): 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: 68Q17 / 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: 05C40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6234615 / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex-colored graph
Property / zbMATH Keywords: vertex-colored graph / rank
 
Normal rank
Property / zbMATH Keywords
 
rainbow vertex-connection number
Property / zbMATH Keywords: rainbow vertex-connection number / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-hard
Property / zbMATH Keywords: NP-hard / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-complete
Property / zbMATH Keywords: NP-complete / rank
 
Normal rank

Revision as of 13:40, 29 June 2023

scientific article
Language Label Description Also known as
English
Further hardness results on the rainbow vertex-connection number of graphs
scientific article

    Statements

    Further hardness results on the rainbow vertex-connection number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    vertex-colored graph
    0 references
    rainbow vertex-connection number
    0 references
    NP-hard
    0 references
    NP-complete
    0 references