Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500)

From MaRDI portal
Revision as of 16:28, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
scientific article

    Statements

    Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (English)
    0 references
    0 references
    0 references
    22 August 2014
    0 references
    rainbow vertex coloring
    0 references
    rainbow vertex-connection number
    0 references
    ear decomposition
    0 references
    2-connected graph
    0 references

    Identifiers