Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and Algorithms for Rainbow Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2857351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Connection of Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Connectivity of Sparse Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hitting time of rainbow connection number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the threshold for rainbow connection number \(r\) in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of rainbow connections for planar and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with rainbow connection number two / 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 of graphs with diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number and connectivity / 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 / cites work
 
Property / cites work: Rainbow Connection in Graphs with Minimum Degree Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimally rainbow \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms / rank
 
Normal rank

Latest revision as of 20:53, 11 July 2024

scientific article
Language Label Description Also known as
English
Rainbow connections for outerplanar graphs with diameter 2 and 3
scientific article

    Statements

    Rainbow connections for outerplanar graphs with diameter 2 and 3 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2016
    0 references
    rainbow connection
    0 references
    coloring
    0 references
    outerplanar graph
    0 references
    diameter
    0 references

    Identifiers