Generalized rainbow connection of graphs and their complements (Q1708384): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.7151/dmgt.2011 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q2829346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5206374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4559905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320410 / 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 connection in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7151/DMGT.2011 / rank
 
Normal rank

Latest revision as of 05:11, 11 December 2024

scientific article
Language Label Description Also known as
English
Generalized rainbow connection of graphs and their complements
scientific article

    Statements

    Generalized rainbow connection of graphs and their complements (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 March 2018
    0 references
    \(\ell\)-rainbow path
    0 references
    \((k, \ell)\)-rainbow connected
    0 references
    \((k, \ell)\)-rainbow connection number
    0 references

    Identifiers