Extremal graphs with maximum monochromatic connectivity (Q776294): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Gallai-type results for colorful monochromatic connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful monochromatic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the colorful monochromatic connectivity / 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

Latest revision as of 02:19, 23 July 2024

scientific article
Language Label Description Also known as
English
Extremal graphs with maximum monochromatic connectivity
scientific article

    Statements

    Extremal graphs with maximum monochromatic connectivity (English)
    0 references
    0 references
    0 references
    0 references
    8 July 2020
    0 references
    monochromatic connection coloring
    0 references
    monochromatic connection number
    0 references
    upper bounds
    0 references
    extremal graphs
    0 references

    Identifiers