Spanning trees with many or few colors in edge-colored graphs (Q4210669): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Hajo J. Broersma / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Xue Liang Li / rank | |||
Normal rank | |||
| 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
