Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372)
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: Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles |
scientific article; zbMATH DE number 6639448
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles |
scientific article; zbMATH DE number 6639448 |
Statements
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (English)
0 references
14 October 2016
0 references
monochromatic cycle partition
0 references
edge-coloured graph
0 references
complete graph
0 references
complete bipartite graph
0 references
0 references
0.9244183897972108
0 references
0.9145132303237916
0 references
0.9008946418762208
0 references
0.8970460891723633
0 references
0.8961595296859741
0 references
