Maximum colored trees in edge-colored graphs (Q2311375)

From MaRDI portal
Revision as of 13:56, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127678239, #quickstatements; #temporary_batch_1722291251637)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximum colored trees in edge-colored graphs
scientific article

    Statements

    title
    Maximum colored trees in edge-colored graphs (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    10 July 2019
    0 references
    Mathematics Subject Classification ID
    05C15
    0 references
    05C05
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    7078538
    0 references
    zbMATH Keywords
    properly edge-colored spanning trees
    0 references
    OpenAlex ID
    W2952726132
    0 references
    Wikidata QID
    Q127678239
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2311375&oldid=37444594"
    Powered by MediaWiki