On rainbow-\(k\)-connectivity of random graphs (Q436344): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q591833
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963274424 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1012.1942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold functions / rank
 
Normal rank
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: The rainbow connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every monotone graph property has a sharp threshold / 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: Q4856179 / rank
 
Normal rank

Latest revision as of 12:32, 5 July 2024

scientific article
Language Label Description Also known as
English
On rainbow-\(k\)-connectivity of random graphs
scientific article

    Statements

    On rainbow-\(k\)-connectivity of random graphs (English)
    0 references
    0 references
    0 references
    20 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    rainbow connectivity
    0 references
    random graph
    0 references
    graph algorithms
    0 references
    sharp threshold function
    0 references
    probabilistic method
    0 references
    0 references
    0 references