Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433)
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-coloured complete graphs into three monochromatic paths |
scientific article; zbMATH DE number 6222091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning 3-coloured complete graphs into three monochromatic paths |
scientific article; zbMATH DE number 6222091 |
Statements
1 November 2013
0 references
Partitioning 3-coloured complete graphs into three monochromatic paths (English)
0 references
0.9452812671661376
0 references
0.8910259008407593
0 references
0.8910154700279236
0 references
Q324825 (Deleted Item)
0.8871608376502991
0 references
Q324825 (Deleted Item)
0.8774571418762207
0 references
