Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825)
From MaRDI portal
(Redirected from Item:Q5379842)
| 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 two-coloured complete multipartite graphs into monochromatic paths and cycles |
scientific article; zbMATH DE number 7066127
- Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles |
scientific article; zbMATH DE number 7066127 |
|
Statements
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (English)
0 references
Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles (English)
0 references
17 October 2016
0 references
14 June 2019
0 references
monochromatic path partition
0 references
monochromatic cycle partition
0 references
two-coloured graph
0 references
0.9978899359703064
0 references
0.9008946418762208
0 references
0.8871608376502991
0 references
0.8808125853538513
0 references
0.8793969750404358
0 references