Color degree sum conditions for properly colored spanning trees in edge-colored graphs (Q2198384)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Color degree sum conditions for properly colored spanning trees in edge-colored graphs |
scientific article; zbMATH DE number 7245946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Color degree sum conditions for properly colored spanning trees in edge-colored graphs |
scientific article; zbMATH DE number 7245946 |
Statements
Color degree sum conditions for properly colored spanning trees in edge-colored graphs (English)
0 references
10 September 2020
0 references
edge-colored graph
0 references
spanning tree
0 references
properly colored
0 references
rainbow
0 references
0.9356930255889891
0 references
0.909912645816803
0 references
0.878847062587738
0 references
0.8536953330039978
0 references
