Maximum properly colored trees in edge-colored graphs (Q2168717)

From MaRDI portal
Revision as of 00:22, 30 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
Maximum properly colored trees in edge-colored graphs
scientific article

    Statements

    title
    Maximum properly colored trees in edge-colored graphs (English)
    0 references
    author
    Jie Hu
    0 references
    Hao Li
    0 references
    Shun-ichi Maezawa
    0 references
    publication date
    26 August 2022
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    90C27
    0 references
    05C15
    0 references
    zbMATH DE Number
    7576475
    0 references
    zbMATH Keywords
    edge-colored graph
    0 references
    properly colored tree
    0 references
    color degree
    0 references
    OpenAlex ID
    W3206039481
    0 references
    cites work
    Q4358434
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2168717&oldid=36847629"
    Powered by MediaWiki