Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870)

From MaRDI portal
Revision as of 12:52, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
scientific article

    Statements

    Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    monochromatic path
    0 references
    MC-coloring
    0 references
    monochromatic connection number
    0 references
    Erdős-Gallai-type problem
    0 references
    0 references
    0 references