Upper bounds for the total rainbow connection of graphs (Q328717): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Hui Jiang / 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05D40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6641538 / rank
 
Normal rank
Property / zbMATH Keywords
 
total-colored graph
Property / zbMATH Keywords: total-colored graph / rank
 
Normal rank
Property / zbMATH Keywords
 
total rainbow connection
Property / zbMATH Keywords: total rainbow connection / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum degree
Property / zbMATH Keywords: minimum degree / rank
 
Normal rank
Property / zbMATH Keywords
 
2-step dominating set
Property / zbMATH Keywords: 2-step dominating set / rank
 
Normal rank

Revision as of 03:36, 28 June 2023

scientific article
Language Label Description Also known as
English
Upper bounds for the total rainbow connection of graphs
scientific article

    Statements

    Upper bounds for the total rainbow connection of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2016
    0 references
    total-colored graph
    0 references
    total rainbow connection
    0 references
    minimum degree
    0 references
    2-step dominating set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references