Note on the upper bound of the rainbow index of a graph (Q298957): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions to conjectures on the (<i>k</i> ,ℓ)-rainbow index of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-rainbow index and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Domination and Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and algorithms for rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-rainbow index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some upper bounds for 3-rainbow index of graphs / rank
 
Normal rank

Latest revision as of 05:33, 12 July 2024

scientific article
Language Label Description Also known as
English
Note on the upper bound of the rainbow index of a graph
scientific article

    Statements

    Identifiers

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