On the number of rainbow spanning trees in edge-colored complete graphs (Q1637154)

From MaRDI portal
Revision as of 00:18, 11 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
On the number of rainbow spanning trees in edge-colored complete graphs
scientific article

    Statements

    title
    On the number of rainbow spanning trees in edge-colored complete graphs (English)
    0 references
    author
    Hung-Lin Fu
    0 references
    Yuan-Hsun Lo
    0 references
    K. E. Perry
    0 references
    C. A. Rodger
    0 references
    publication date
    7 June 2018
    0 references
    zbMATH Keywords
    edge-coloring
    0 references
    complete graph
    0 references
    rainbow spanning tree
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C15
    0 references
    05C30
    0 references
    05C05
    0 references
    zbMATH DE Number
    6882089
    0 references
    OpenAlex ID
    W2963572511
    0 references
    arXiv ID
    1605.04501
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1637154&oldid=38677224"
    Powered by MediaWiki