Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591)
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 edge-coloured complete graphs into monochromatic cycles and paths |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning edge-coloured complete graphs into monochromatic cycles and paths |
scientific article |
Statements
Partitioning edge-coloured complete graphs into monochromatic cycles and paths (English)
0 references
28 August 2014
0 references
graph partitioning
0 references
Ramsey theory
0 references
0.9452812671661376
0 references
0.9221823811531068
0 references
0.8879465460777283
0 references
