Hardness and algorithms for rainbow connection (Q491198)

From MaRDI portal
Revision as of 16:05, 10 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
Hardness and algorithms for rainbow connection
scientific article

    Statements

    title
    Hardness and algorithms for rainbow connection (English)
    0 references
    author
    Sourav Chakraborty
    0 references
    Eldar Fischer
    0 references
    Arie Matsliah
    0 references
    Raphael Yuster
    0 references
    publication date
    24 August 2015
    0 references
    zbMATH Keywords
    connectivity
    0 references
    rainbow coloring
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C15
    0 references
    05C40
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6475135
    0 references
    OpenAlex ID
    W2150438015
    0 references
    arXiv ID
    0809.2493
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q491198&oldid=36197575"
    Powered by MediaWiki