Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076)

From MaRDI portal
Revision as of 15:31, 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
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
scientific article

    Statements

    title
    Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (English)
    0 references
    author
    Lily Chen
    0 references
    Xue Liang Li
    0 references
    Hui-shu Lian
    0 references
    publication date
    26 September 2013
    0 references
    zbMATH Keywords
    edge-colored graph
    0 references
    rainbow connection number
    0 references
    Nordhaus-Gaddum-type
    0 references

    Identifiers

    zbMATH DE Number
    6211664
    0 references
    OpenAlex ID
    W2000391936
    0 references
    arXiv ID
    1012.2641
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q367076&oldid=38320712"
    Powered by MediaWiki