Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514)
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 a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles |
scientific article; zbMATH DE number 7920431
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles |
scientific article; zbMATH DE number 7920431 |
Statements
Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (English)
0 references
30 September 2024
0 references
graph partition
0 references
two-colored complete graph
0 references
cycle decomposition
0 references
0 references
