Spanning trees with many or few colors in edge-colored graphs (Q4210669): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2139317321 / rank | |||
Normal rank |
Latest revision as of 02:23, 20 March 2024
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
28 October 1999
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