Partitioning complete graphs by heterochromatic trees (Q692699)
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 6113038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning complete graphs by heterochromatic trees |
scientific article; zbMATH DE number 6113038 |
Statements
Partitioning complete graphs by heterochromatic trees (English)
0 references
6 December 2012
0 references
edge-colored graph
0 references
heterochromatic tree
0 references
partition
0 references
0 references
0.9550507
0 references
0.9545164
0 references
0.9530789
0 references
0.9470623
0 references
0 references
0.92626625
0 references
0 references
0 references
0 references
0.91217387
0 references
