Graphs with 3-rainbow index \(n-1\) and \(n-2\) (Q2259573): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xue Liang Li / rank
Normal rank
 
Property / author
 
Property / author: Xue Liang Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081078825 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1308.4251 / 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: On rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank

Latest revision as of 19:32, 9 July 2024

scientific article
Language Label Description Also known as
English
Graphs with 3-rainbow index \(n-1\) and \(n-2\)
scientific article

    Statements

    Graphs with 3-rainbow index \(n-1\) and \(n-2\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 March 2015
    0 references
    rainbow \(S\)-tree
    0 references
    \(k\)-rainbow index
    0 references

    Identifiers

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