Spanning trees with many or few colors in edge-colored graphs (Q4210669)

From MaRDI portal
Revision as of 02:23, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1202462
Language Label Description Also known as
English
Spanning trees with many or few colors in edge-colored graphs
scientific article; zbMATH DE number 1202462

    Statements

    Spanning trees with many or few colors in edge-colored graphs (English)
    0 references
    0 references
    28 October 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    edge-coloring
    0 references
    spanning tree
    0 references
    matroids
    0 references
    polynomial algorithm
    0 references
    dominating set
    0 references
    NP-hard
    0 references
    0 references
    0 references
    0 references