Rainbow and monochromatic vertex-connection of random graphs (Q2087672): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10255-022-1027-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4306774471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of almost all graphs and complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extremal results on the colorful monochromatic vertex-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful monochromatic connectivity / 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: The complexity of determining the rainbow vertex-connection of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Connection of Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the colorful monochromatic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow-\(k\)-connectivity of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for three kinds of colored connections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs with maximum monochromatic connectivity / 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 / cites work
 
Property / cites work: The (vertex-)monochromatic index of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:19, 30 July 2024

scientific article
Language Label Description Also known as
English
Rainbow and monochromatic vertex-connection of random graphs
scientific article

    Statements

    Rainbow and monochromatic vertex-connection of random graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2022
    0 references
    graph coloring
    0 references
    rainbow vertex-connection number
    0 references
    monochromatic vertex-connection number
    0 references
    random graphs
    0 references
    threshold function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references