On the number of rainbow spanning trees in edge-colored complete graphs (Q1637154)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6882089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of rainbow spanning trees in edge-colored complete graphs |
scientific article; zbMATH DE number 6882089 |
Statements
On the number of rainbow spanning trees in edge-colored complete graphs (English)
0 references
7 June 2018
0 references
edge-coloring
0 references
complete graph
0 references
rainbow spanning tree
0 references
0.9315394163131714
0 references
0.9291638731956482
0 references
0.9213846325874328
0 references
0.8919936418533325
0 references
0.8841754794120789
0 references
